/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-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:03:56,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:03:56,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:03:56,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:03:56,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:03:56,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:03:56,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:03:56,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:03:56,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:03:56,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:03:56,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:03:56,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:03:56,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:03:56,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:03:56,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:03:56,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:03:56,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:03:56,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:03:56,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:03:56,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:03:56,932 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:03:56,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:03:56,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:03:56,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:03:56,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:03:56,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:03:56,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:03:56,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:03:56,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:03:56,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:03:56,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:03:56,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:03:56,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:03:56,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:03:56,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:03:56,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:03:56,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:03:56,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:03:56,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:03:56,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:03:56,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:03:56,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:03:56,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:03:56,964 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:03:56,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:03:56,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:03:56,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:03:56,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:03:56,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:03:56,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:03:56,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:03:56,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:03:56,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:03:56,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:03:56,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:03:56,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:56,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:03:56,968 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:03:56,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:03:56,969 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:03:56,969 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-28 10:03:57,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:03:57,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:03:57,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:03:57,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:03:57,231 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:03:57,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-28 10:03:57,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9572082cc/e67b09105ac84bbeb7b529be4e48684d/FLAG525a3bb9d [2022-04-28 10:03:57,663 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:03:57,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-28 10:03:57,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9572082cc/e67b09105ac84bbeb7b529be4e48684d/FLAG525a3bb9d [2022-04-28 10:03:57,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9572082cc/e67b09105ac84bbeb7b529be4e48684d [2022-04-28 10:03:57,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:03:57,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:03:57,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:57,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:03:57,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:03:57,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f84abab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57, skipping insertion in model container [2022-04-28 10:03:57,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:03:57,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:03:57,834 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-de32.c[368,381] [2022-04-28 10:03:57,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:57,857 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:03:57,867 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-de32.c[368,381] [2022-04-28 10:03:57,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:57,881 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:03:57,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57 WrapperNode [2022-04-28 10:03:57,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:57,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:03:57,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:03:57,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:03:57,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:03:57,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:03:57,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:03:57,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:03:57,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (1/1) ... [2022-04-28 10:03:57,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:57,945 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-28 10:03:57,951 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-28 10:03:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:03:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:03:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:03:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:03:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:03:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:03:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:03:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:03:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:03:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:03:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:03:58,033 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:03:58,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:03:58,183 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:03:58,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:03:58,195 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:03:58,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:58 BoogieIcfgContainer [2022-04-28 10:03:58,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:03:58,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:03:58,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:03:58,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:03:58,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:03:57" (1/3) ... [2022-04-28 10:03:58,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409aa202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:58, skipping insertion in model container [2022-04-28 10:03:58,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:57" (2/3) ... [2022-04-28 10:03:58,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409aa202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:58, skipping insertion in model container [2022-04-28 10:03:58,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:58" (3/3) ... [2022-04-28 10:03:58,232 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-28 10:03:58,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:03:58,245 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:03:58,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:03:58,319 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@526a0b6c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f870b39 [2022-04-28 10:03:58,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:03:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:03:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:03:58,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:58,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:58,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-28 10:03:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:58,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102921247] [2022-04-28 10:03:58,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:03:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-28 10:03:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:58,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899711054] [2022-04-28 10:03:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:58,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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); {25#true} is VALID [2022-04-28 10:03:58,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:03:58,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 10:03:58,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:58,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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); {25#true} is VALID [2022-04-28 10:03:58,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:03:58,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 10:03:58,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-28 10:03:58,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-28 10:03:58,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:03:58,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:03:58,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:03:58,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:03:58,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:03:58,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:03:58,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-28 10:03:58,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 10:03:58,736 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-28 10:03:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:58,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899711054] [2022-04-28 10:03:58,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899711054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:58,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:58,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:58,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102921247] [2022-04-28 10:03:58,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102921247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:58,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:58,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474227015] [2022-04-28 10:03:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:03:58,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:58,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:58,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:58,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:03:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:03:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:03:58,812 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,164 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 10:03:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:03:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:03:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 10:03:59,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-28 10:03:59,244 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-28 10:03:59,264 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:03:59,264 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:03:59,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:03:59,275 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:59,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:03:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:03:59,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:59,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,312 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,313 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,318 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 10:03:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:03:59,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:03:59,320 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:03:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,323 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 10:03:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:03:59,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:59,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 10:03:59,333 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-28 10:03:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:59,333 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 10:03:59,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 10:03:59,355 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-28 10:03:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 10:03:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:03:59,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:59,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:59,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:03:59,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-28 10:03:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069900164] [2022-04-28 10:03:59,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-28 10:03:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:59,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127789838] [2022-04-28 10:03:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(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); {206#true} is VALID [2022-04-28 10:03:59,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-28 10:03:59,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-28 10:03:59,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:59,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(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); {206#true} is VALID [2022-04-28 10:03:59,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-28 10:03:59,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-28 10:03:59,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-28 10:03:59,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {211#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {207#false} is VALID [2022-04-28 10:03:59,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-28 10:03:59,466 INFO L272 TraceCheckUtils]: 11: Hoare triple {207#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2022-04-28 10:03:59,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-28 10:03:59,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-28 10:03:59,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-28 10:03:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:59,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127789838] [2022-04-28 10:03:59,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127789838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:59,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:59,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:03:59,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:59,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069900164] [2022-04-28 10:03:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069900164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:03:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498041426] [2022-04-28 10:03:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:59,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:03:59,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:59,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,483 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-28 10:03:59,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:03:59,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:03:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:03:59,485 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,555 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-28 10:03:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:03:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:03:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:03:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:03:59,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 10:03:59,586 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-28 10:03:59,587 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:03:59,587 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:03:59,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:03:59,589 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:59,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:03:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:03:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 10:03:59,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:59,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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-28 10:03:59,597 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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-28 10:03:59,597 INFO L87 Difference]: Start difference. First operand 23 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-28 10:03:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,598 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 10:03:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:03:59,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,599 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 23 states. [2022-04-28 10:03:59,599 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 23 states. [2022-04-28 10:03:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,601 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 10:03:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 10:03:59,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:59,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:59,602 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-28 10:03:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 10:03:59,603 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-28 10:03:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:59,604 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 10:03:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 10:03:59,631 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-28 10:03:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 10:03:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:03:59,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:59,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:03:59,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-28 10:03:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291558820] [2022-04-28 10:03:59,648 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:59,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 2 times [2022-04-28 10:03:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:59,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089102801] [2022-04-28 10:03:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:59,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(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); {367#true} is VALID [2022-04-28 10:03:59,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-28 10:03:59,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-28 10:03:59,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:59,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(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); {367#true} is VALID [2022-04-28 10:03:59,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-28 10:03:59,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-28 10:03:59,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret11 := main(); {367#true} is VALID [2022-04-28 10:03:59,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {372#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {372#(= main_~y~0 0)} is VALID [2022-04-28 10:03:59,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(= main_~y~0 0)} ~z~0 := ~y~0; {373#(= main_~z~0 0)} is VALID [2022-04-28 10:03:59,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(= 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; {368#false} is VALID [2022-04-28 10:03:59,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#false} assume !(~z~0 % 4294967296 > 0); {368#false} is VALID [2022-04-28 10:03:59,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#false} assume !(~y~0 % 4294967296 > 0); {368#false} is VALID [2022-04-28 10:03:59,703 INFO L272 TraceCheckUtils]: 11: Hoare triple {368#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {368#false} is VALID [2022-04-28 10:03:59,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#false} ~cond := #in~cond; {368#false} is VALID [2022-04-28 10:03:59,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} assume 0 == ~cond; {368#false} is VALID [2022-04-28 10:03:59,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-28 10:03:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:59,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089102801] [2022-04-28 10:03:59,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089102801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:59,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:03:59,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:59,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291558820] [2022-04-28 10:03:59,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291558820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:59,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:59,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:03:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636964096] [2022-04-28 10:03:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:59,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,718 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-28 10:03:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:03:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:03:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:03:59,719 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,816 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 10:03:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:03:59,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 10:03:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 10:03:59,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 10:03:59,849 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-28 10:03:59,850 INFO L225 Difference]: With dead ends: 27 [2022-04-28 10:03:59,850 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:03:59,851 INFO L412 NwaCegarLoop]: 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-28 10:03:59,852 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:59,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:03:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:03:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:03:59,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:59,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,856 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,857 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,858 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 10:03:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 10:03:59,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:03:59,859 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:03:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:59,860 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 10:03:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 10:03:59,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:59,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:59,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:59,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 10:03:59,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-28 10:03:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:59,862 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 10:03:59,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-28 10:03:59,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 10:03:59,883 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-28 10:03:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 10:03:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:03:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:59,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:03:59,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-28 10:03:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746664026] [2022-04-28 10:03:59,890 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:59,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 2 times [2022-04-28 10:03:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:59,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422868614] [2022-04-28 10:03:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:00,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#(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); {507#true} is VALID [2022-04-28 10:04:00,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 10:04:00,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 10:04:00,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:00,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#(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); {507#true} is VALID [2022-04-28 10:04:00,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 10:04:00,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 10:04:00,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-28 10:04:00,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {512#(= main_~y~0 0)} is VALID [2022-04-28 10:04:00,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(= 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; {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:00,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:00,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {514#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:00,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {508#false} is VALID [2022-04-28 10:04:00,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-28 10:04:00,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-28 10:04:00,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-28 10:04:00,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-28 10:04:00,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-28 10:04:00,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 10:04:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:04:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:00,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422868614] [2022-04-28 10:04:00,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422868614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:00,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514173348] [2022-04-28 10:04:00,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:00,019 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-28 10:04:00,050 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-28 10:04:00,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:00,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:00,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:04:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:00,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:00,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 10:04:00,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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); {507#true} is VALID [2022-04-28 10:04:00,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 10:04:00,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 10:04:00,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-28 10:04:00,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {512#(= main_~y~0 0)} is VALID [2022-04-28 10:04:00,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(= 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; {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:00,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:00,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {543#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:00,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {508#false} is VALID [2022-04-28 10:04:00,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-28 10:04:00,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-28 10:04:00,223 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-28 10:04:00,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-28 10:04:00,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-28 10:04:00,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 10:04:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:04:00,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:00,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 10:04:00,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2022-04-28 10:04:00,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2022-04-28 10:04:00,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {508#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {508#false} is VALID [2022-04-28 10:04:00,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#false} assume !(~y~0 % 4294967296 > 0); {508#false} is VALID [2022-04-28 10:04:00,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {508#false} is VALID [2022-04-28 10:04:00,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {580#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:00,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} ~z~0 := ~y~0; {584#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:04:00,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} assume !(~x~0 % 4294967296 > 0); {507#true} is VALID [2022-04-28 10:04:00,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#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; {507#true} is VALID [2022-04-28 10:04:00,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {507#true} is VALID [2022-04-28 10:04:00,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret11 := main(); {507#true} is VALID [2022-04-28 10:04:00,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 10:04:00,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 10:04:00,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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); {507#true} is VALID [2022-04-28 10:04:00,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 10:04:00,332 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-28 10:04:00,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514173348] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:00,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:04:00,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-04-28 10:04:00,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:00,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746664026] [2022-04-28 10:04:00,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746664026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:00,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:00,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:04:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504947162] [2022-04-28 10:04:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:00,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 10:04:00,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:00,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,366 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-28 10:04:00,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:04:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:04:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:04:00,367 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,410 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 10:04:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:04:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 10:04:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 10:04:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 10:04:00,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 10:04:00,445 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-28 10:04:00,446 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:04:00,446 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:04:00,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:04:00,447 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:00,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:04:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:04:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:04:00,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:00,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,456 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,456 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,457 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:04:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:04:00,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:00,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:00,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:04:00,458 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 10:04:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:00,459 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:04:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:04:00,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:00,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:00,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:00,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:04:00,460 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-28 10:04:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:00,460 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:04:00,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:00,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:04:00,482 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-28 10:04:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:04:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:04:00,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:00,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:00,515 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-28 10:04:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:00,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-28 10:04:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567362221] [2022-04-28 10:04:00,700 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:00,700 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 2 times [2022-04-28 10:04:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:00,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583231533] [2022-04-28 10:04:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:00,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {737#(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); {730#true} is VALID [2022-04-28 10:04:00,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-28 10:04:00,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-28 10:04:00,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:00,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {737#(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); {730#true} is VALID [2022-04-28 10:04:00,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-28 10:04:00,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-28 10:04:00,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-28 10:04:00,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {735#(= main_~y~0 0)} is VALID [2022-04-28 10:04:00,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#(= 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; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:04:00,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:04:00,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} ~z~0 := ~y~0; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:04:00,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~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; {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:04:00,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:04:00,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-28 10:04:00,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-28 10:04:00,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-28 10:04:00,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-28 10:04:00,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-28 10:04:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:04:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:00,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583231533] [2022-04-28 10:04:00,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583231533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:00,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837147367] [2022-04-28 10:04:00,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:00,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:00,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:00,775 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-28 10:04:00,784 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-28 10:04:00,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:00,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:00,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:04:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:00,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:00,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2022-04-28 10:04:00,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#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); {730#true} is VALID [2022-04-28 10:04:00,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-28 10:04:00,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-28 10:04:00,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-28 10:04:00,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {735#(= main_~y~0 0)} is VALID [2022-04-28 10:04:00,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {735#(= 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; {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 10:04:00,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~x~0 % 4294967296 > 0); {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 10:04:00,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} ~z~0 := ~y~0; {766#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:04:00,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(and (= main_~z~0 main_~y~0) (= (+ (- 1) main_~y~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; {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 10:04:00,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~z~0 % 4294967296 > 0); {759#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 10:04:00,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {759#(= (+ (- 1) main_~y~0) 0)} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-28 10:04:00,938 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-28 10:04:00,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-28 10:04:00,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-28 10:04:00,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-28 10:04:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:00,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:01,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-04-28 10:04:01,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {731#false} assume 0 == ~cond; {731#false} is VALID [2022-04-28 10:04:01,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {731#false} ~cond := #in~cond; {731#false} is VALID [2022-04-28 10:04:01,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {731#false} is VALID [2022-04-28 10:04:01,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {731#false} is VALID [2022-04-28 10:04:01,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:01,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {807#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (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; {800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:01,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} ~z~0 := ~y~0; {807#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:01,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} assume !(~x~0 % 4294967296 > 0); {730#true} is VALID [2022-04-28 10:04:01,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#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; {730#true} is VALID [2022-04-28 10:04:01,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {730#true} is VALID [2022-04-28 10:04:01,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret11 := main(); {730#true} is VALID [2022-04-28 10:04:01,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #61#return; {730#true} is VALID [2022-04-28 10:04:01,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2022-04-28 10:04:01,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#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); {730#true} is VALID [2022-04-28 10:04:01,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2022-04-28 10:04:01,044 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-28 10:04:01,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837147367] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:01,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:04:01,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2022-04-28 10:04:01,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:01,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567362221] [2022-04-28 10:04:01,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567362221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:01,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:01,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:04:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561325098] [2022-04-28 10:04:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 10:04:01,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:01,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,058 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-28 10:04:01,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:04:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:01,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:04:01,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:04:01,059 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:01,095 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 10:04:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:04:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-28 10:04:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-28 10:04:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-28 10:04:01,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-04-28 10:04:01,119 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-28 10:04:01,120 INFO L225 Difference]: With dead ends: 23 [2022-04-28 10:04:01,120 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:04:01,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:04:01,121 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:04:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:04:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:04:01,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:01,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,129 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,129 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:01,131 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 10:04:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:04:01,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:01,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:04:01,132 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 10:04:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:01,133 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 10:04:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:04:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:01,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:01,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:01,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 10:04:01,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-28 10:04:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:01,135 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 10:04:01,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:01,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 10:04:01,153 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-28 10:04:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:04:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:04:01,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:01,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:01,180 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-28 10:04:01,367 WARN L477 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-28 10:04:01,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-28 10:04:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:01,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837943835] [2022-04-28 10:04:01,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:01,374 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 2 times [2022-04-28 10:04:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:01,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932064019] [2022-04-28 10:04:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {964#(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); {955#true} is VALID [2022-04-28 10:04:01,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-28 10:04:01,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-28 10:04:01,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:01,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#(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); {955#true} is VALID [2022-04-28 10:04:01,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-28 10:04:01,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-28 10:04:01,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-28 10:04:01,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-28 10:04:01,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#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; {955#true} is VALID [2022-04-28 10:04:01,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 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; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:01,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:01,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,519 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {962#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:01,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {962#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {963#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:01,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {963#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {956#false} is VALID [2022-04-28 10:04:01,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-28 10:04:01,521 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-28 10:04:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:01,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932064019] [2022-04-28 10:04:01,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932064019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:01,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373709710] [2022-04-28 10:04:01,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:01,524 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-28 10:04:01,551 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-28 10:04:01,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:01,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:04:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:01,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:01,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2022-04-28 10:04:01,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#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); {955#true} is VALID [2022-04-28 10:04:01,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-28 10:04:01,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-28 10:04:01,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-28 10:04:01,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-28 10:04:01,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#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; {955#true} is VALID [2022-04-28 10:04:01,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 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; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:01,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:01,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:01,892 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:01,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:01,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {956#false} is VALID [2022-04-28 10:04:01,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-28 10:04:01,894 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-28 10:04:01,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:02,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#false} assume !false; {956#false} is VALID [2022-04-28 10:04:02,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {956#false} is VALID [2022-04-28 10:04:02,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:02,208 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:02,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:02,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:02,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:02,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 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; {961#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:04:02,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:02,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#true} assume !(~x~0 % 4294967296 > 0); {960#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:04:02,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#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; {955#true} is VALID [2022-04-28 10:04:02,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {955#true} is VALID [2022-04-28 10:04:02,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret11 := main(); {955#true} is VALID [2022-04-28 10:04:02,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #61#return; {955#true} is VALID [2022-04-28 10:04:02,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2022-04-28 10:04:02,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#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); {955#true} is VALID [2022-04-28 10:04:02,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2022-04-28 10:04:02,218 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-28 10:04:02,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373709710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:02,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:02,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 10:04:02,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:02,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837943835] [2022-04-28 10:04:02,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837943835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:02,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:02,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:04:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962681115] [2022-04-28 10:04:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:02,219 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), 5 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-28 10:04:02,237 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-28 10:04:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:04:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:04:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:04:02,238 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,466 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 10:04:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:04:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:04:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:04:02,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 10:04:02,500 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-28 10:04:02,501 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:04:02,501 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:04:02,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:04:02,502 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:02,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:04:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:04:02,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:02,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:02,517 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:02,517 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,522 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:04:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:04:02,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:02,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:02,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:04:02,522 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:04:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:02,524 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:04:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:04:02,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:02,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:02,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:02,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 10:04:02,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-28 10:04:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:02,531 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 10:04:02,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 10:04:02,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 10:04:02,557 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-28 10:04:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:04:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:04:02,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:02,558 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:02,584 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-28 10:04:02,758 WARN L477 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-28 10:04:02,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 3 times [2022-04-28 10:04:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:02,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [793435495] [2022-04-28 10:04:02,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:02,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 4 times [2022-04-28 10:04:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:02,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304749720] [2022-04-28 10:04:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:02,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#(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); {1210#true} is VALID [2022-04-28 10:04:02,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 10:04:02,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-28 10:04:02,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:02,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#(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); {1210#true} is VALID [2022-04-28 10:04:02,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 10:04:02,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-28 10:04:02,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-28 10:04:02,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1215#(= main_~y~0 0)} is VALID [2022-04-28 10:04:02,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(= 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; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:02,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:02,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:02,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {1216#(and (<= 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; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:02,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:02,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1215#(= main_~y~0 0)} is VALID [2022-04-28 10:04:02,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {1215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-28 10:04:02,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-28 10:04:02,869 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-28 10:04:02,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-28 10:04:02,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 10:04:02,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 10:04:02,870 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-28 10:04:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:02,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304749720] [2022-04-28 10:04:02,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304749720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:02,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534690975] [2022-04-28 10:04:02,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:02,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:02,872 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-28 10:04:02,880 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-28 10:04:02,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:02,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:02,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:04:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:02,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:03,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-28 10:04:03,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#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); {1210#true} is VALID [2022-04-28 10:04:03,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 10:04:03,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-28 10:04:03,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-28 10:04:03,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1215#(= main_~y~0 0)} is VALID [2022-04-28 10:04:03,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {1215#(= 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; {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1245#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1245#(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; {1249#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1249#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1215#(= main_~y~0 0)} is VALID [2022-04-28 10:04:03,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1215#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-28 10:04:03,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-28 10:04:03,072 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-28 10:04:03,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-28 10:04:03,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 10:04:03,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 10:04:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:03,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2022-04-28 10:04:03,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} assume 0 == ~cond; {1211#false} is VALID [2022-04-28 10:04:03,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} ~cond := #in~cond; {1211#false} is VALID [2022-04-28 10:04:03,180 INFO L272 TraceCheckUtils]: 14: Hoare triple {1211#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1211#false} is VALID [2022-04-28 10:04:03,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#false} assume !(~y~0 % 4294967296 > 0); {1211#false} is VALID [2022-04-28 10:04:03,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {1289#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1211#false} is VALID [2022-04-28 10:04:03,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1289#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:03,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1297#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1293#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:03,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {1301#(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; {1297#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:03,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#true} ~z~0 := ~y~0; {1301#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:03,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !(~x~0 % 4294967296 > 0); {1210#true} is VALID [2022-04-28 10:04:03,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#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; {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret11 := main(); {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #61#return; {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#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); {1210#true} is VALID [2022-04-28 10:04:03,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1210#true} is VALID [2022-04-28 10:04:03,190 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-28 10:04:03,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534690975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:03,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:03,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-28 10:04:03,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [793435495] [2022-04-28 10:04:03,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [793435495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:03,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:03,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:04:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989867208] [2022-04-28 10:04:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:03,192 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-28 10:04:03,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:03,193 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-28 10:04:03,208 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-28 10:04:03,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:04:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:04:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:04:03,210 INFO L87 Difference]: Start difference. First operand 20 states and 23 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-28 10:04:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:03,332 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:04:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:04:03,332 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-28 10:04:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:03,332 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-28 10:04:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 10:04:03,335 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-28 10:04:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 10:04:03,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-28 10:04:03,364 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-28 10:04:03,367 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:04:03,367 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:04:03,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:04:03,368 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:03,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:04:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:04:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 10:04:03,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:03,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:03,395 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:03,395 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:03,397 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 10:04:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-28 10:04:03,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:03,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:03,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 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 28 states. [2022-04-28 10:04:03,401 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 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 28 states. [2022-04-28 10:04:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:03,402 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 10:04:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-28 10:04:03,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:03,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:03,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:03,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-28 10:04:03,404 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2022-04-28 10:04:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:03,405 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-28 10:04:03,405 INFO L496 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-28 10:04:03,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-28 10:04:03,437 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-28 10:04:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 10:04:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:04:03,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:03,439 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:03,469 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-28 10:04:03,652 WARN L477 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-28 10:04:03,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 5 times [2022-04-28 10:04:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:03,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124808842] [2022-04-28 10:04:03,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:03,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 6 times [2022-04-28 10:04:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:03,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219710693] [2022-04-28 10:04:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1526#(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); {1517#true} is VALID [2022-04-28 10:04:03,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-28 10:04:03,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-28 10:04:03,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:03,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#(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); {1517#true} is VALID [2022-04-28 10:04:03,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-28 10:04:03,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-28 10:04:03,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-28 10:04:03,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1522#(= main_~y~0 0)} is VALID [2022-04-28 10:04:03,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#(= 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; {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1524#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:03,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(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; {1525#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:04:03,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#(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; {1518#false} is VALID [2022-04-28 10:04:03,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} assume !(~z~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-28 10:04:03,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1518#false} is VALID [2022-04-28 10:04:03,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-28 10:04:03,737 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-28 10:04:03,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-28 10:04:03,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-28 10:04:03,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-28 10:04:03,738 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-28 10:04:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:03,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219710693] [2022-04-28 10:04:03,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219710693] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:03,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128420653] [2022-04-28 10:04:03,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:03,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:03,740 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-28 10:04:03,774 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-28 10:04:03,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:04:03,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:03,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:04:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:03,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:03,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2022-04-28 10:04:03,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#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); {1517#true} is VALID [2022-04-28 10:04:03,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-28 10:04:03,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-28 10:04:03,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-28 10:04:03,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1522#(= main_~y~0 0)} is VALID [2022-04-28 10:04:03,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {1522#(= 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; {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1554#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(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; {1558#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(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; {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#false} assume !(~z~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {1518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {1518#false} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-28 10:04:03,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-28 10:04:03,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-28 10:04:03,896 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-28 10:04:03,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:04,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2022-04-28 10:04:04,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2022-04-28 10:04:04,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2022-04-28 10:04:04,003 INFO L272 TraceCheckUtils]: 14: Hoare triple {1518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1518#false} is VALID [2022-04-28 10:04:04,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1595#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1518#false} is VALID [2022-04-28 10:04:04,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1595#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:04,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:04,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1606#(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; {1599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:04,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {1610#(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; {1606#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:04:04,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {1517#true} ~z~0 := ~y~0; {1610#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:04,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#true} assume !(~x~0 % 4294967296 > 0); {1517#true} is VALID [2022-04-28 10:04:04,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#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; {1517#true} is VALID [2022-04-28 10:04:04,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {1517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1517#true} is VALID [2022-04-28 10:04:04,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret11 := main(); {1517#true} is VALID [2022-04-28 10:04:04,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #61#return; {1517#true} is VALID [2022-04-28 10:04:04,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2022-04-28 10:04:04,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {1517#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); {1517#true} is VALID [2022-04-28 10:04:04,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2022-04-28 10:04:04,008 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-28 10:04:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128420653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:04,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:04,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 10:04:04,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:04,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124808842] [2022-04-28 10:04:04,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124808842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:04,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:04,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:04:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121587685] [2022-04-28 10:04:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:04,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,022 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-28 10:04:04,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:04:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:04:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:04:04,024 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,195 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 10:04:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:04:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:04:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:04:04,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 10:04:04,224 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-28 10:04:04,224 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:04:04,224 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:04:04,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:04:04,226 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:04,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:04:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:04:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 10:04:04,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:04,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:04,239 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:04,240 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,241 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:04:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:04:04,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:04:04,241 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:04:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,242 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:04:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:04:04,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:04,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 10:04:04,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2022-04-28 10:04:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:04,244 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 10:04:04,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 10:04:04,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 10:04:04,265 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-28 10:04:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:04:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:04:04,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:04,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:04,291 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-28 10:04:04,479 WARN L477 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-28 10:04:04,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 7 times [2022-04-28 10:04:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775721473] [2022-04-28 10:04:04,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:04,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 8 times [2022-04-28 10:04:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:04,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105995701] [2022-04-28 10:04:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {1806#(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); {1796#true} is VALID [2022-04-28 10:04:04,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-28 10:04:04,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-28 10:04:04,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:04,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1806#(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); {1796#true} is VALID [2022-04-28 10:04:04,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-28 10:04:04,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-28 10:04:04,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-28 10:04:04,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1801#(= main_~y~0 0)} is VALID [2022-04-28 10:04:04,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(= 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; {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:04,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {1802#(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; {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:04,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:04,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1804#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:04,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {1804#(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; {1805#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:04,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1805#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-28 10:04:04,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-28 10:04:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105995701] [2022-04-28 10:04:04,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105995701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:04,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339552354] [2022-04-28 10:04:04,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:04,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:04,580 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-28 10:04:04,589 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-28 10:04:04,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:04,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:04,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:04:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:04,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:04,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-28 10:04:04,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#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); {1796#true} is VALID [2022-04-28 10:04:04,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-28 10:04:04,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-28 10:04:04,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-28 10:04:04,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1801#(= main_~y~0 0)} is VALID [2022-04-28 10:04:04,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {1801#(= 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; {1802#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:04,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {1802#(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; {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:04,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:04,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1837#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:04,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1837#(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; {1841#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:04,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {1841#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-28 10:04:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:04,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:04,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#false} assume !false; {1797#false} is VALID [2022-04-28 10:04:04,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#false} assume 0 == ~cond; {1797#false} is VALID [2022-04-28 10:04:04,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#false} ~cond := #in~cond; {1797#false} is VALID [2022-04-28 10:04:04,889 INFO L272 TraceCheckUtils]: 15: Hoare triple {1797#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1797#false} is VALID [2022-04-28 10:04:04,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#false} assume !(~y~0 % 4294967296 > 0); {1797#false} is VALID [2022-04-28 10:04:04,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1881#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1797#false} is VALID [2022-04-28 10:04:04,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {1885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1881#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:04,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {1889#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1885#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:04,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {1893#(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; {1889#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:04,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#true} ~z~0 := ~y~0; {1893#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:04,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {1796#true} assume !(~x~0 % 4294967296 > 0); {1796#true} is VALID [2022-04-28 10:04:04,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {1796#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; {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {1796#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; {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {1796#true} call #t~ret11 := main(); {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1796#true} {1796#true} #61#return; {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {1796#true} assume true; {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1796#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); {1796#true} is VALID [2022-04-28 10:04:04,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {1796#true} call ULTIMATE.init(); {1796#true} is VALID [2022-04-28 10:04:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:04,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339552354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:04,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-28 10:04:04,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:04,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775721473] [2022-04-28 10:04:04,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775721473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:04,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:04:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824650038] [2022-04-28 10:04:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:04,900 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 19 [2022-04-28 10:04:04,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:04,900 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-28 10:04:04,913 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-28 10:04:04,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:04:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:04:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:04:04,915 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-28 10:04:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:05,156 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-28 10:04:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:04:05,156 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 19 [2022-04-28 10:04:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:05,156 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-28 10:04:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:04:05,158 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-28 10:04:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:04:05,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 10:04:05,191 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-28 10:04:05,193 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:04:05,193 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:04:05,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 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-28 10:04:05,195 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:05,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:04:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 10:04:05,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:05,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:05,222 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:05,222 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:05,223 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 10:04:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 10:04:05,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:05,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:05,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 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 30 states. [2022-04-28 10:04:05,224 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 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 30 states. [2022-04-28 10:04:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:05,225 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 10:04:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 10:04:05,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:05,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:05,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:05,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 10:04:05,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2022-04-28 10:04:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:05,227 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 10:04:05,227 INFO L496 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-28 10:04:05,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 10:04:05,266 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-28 10:04:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 10:04:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:04:05,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:05,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:05,295 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-28 10:04:05,487 WARN L477 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-28 10:04:05,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 9 times [2022-04-28 10:04:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:05,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045197934] [2022-04-28 10:04:05,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:05,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 10 times [2022-04-28 10:04:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:05,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114295169] [2022-04-28 10:04:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {2140#(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); {2130#true} is VALID [2022-04-28 10:04:05,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:04:05,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:05,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(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); {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:05,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:05,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= 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; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:05,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= 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; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:05,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:05,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:05,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,653 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2138#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:05,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2139#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:05,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {2139#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:04:05,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:04:05,654 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-28 10:04:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114295169] [2022-04-28 10:04:05,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114295169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665516325] [2022-04-28 10:04:05,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:05,655 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-28 10:04:05,664 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-28 10:04:05,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:05,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:05,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:04:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:05,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#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); {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-28 10:04:05,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:05,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:05,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= 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; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:05,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= 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; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:05,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:05,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:05,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:05,969 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:05,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:05,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:04:05,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:04:05,970 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-28 10:04:05,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:06,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-28 10:04:06,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {2196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2022-04-28 10:04:06,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:06,250 INFO L272 TraceCheckUtils]: 16: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:06,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:06,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:06,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:06,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:06,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {2136#(<= 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; {2137#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:06,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {2135#(<= 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; {2136#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:06,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:06,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#true} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:06,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:06,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#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; {2130#true} is VALID [2022-04-28 10:04:06,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2130#true} is VALID [2022-04-28 10:04:06,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret11 := main(); {2130#true} is VALID [2022-04-28 10:04:06,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #61#return; {2130#true} is VALID [2022-04-28 10:04:06,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-28 10:04:06,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#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); {2130#true} is VALID [2022-04-28 10:04:06,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-28 10:04:06,256 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-28 10:04:06,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665516325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:06,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:06,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:04:06,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:06,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045197934] [2022-04-28 10:04:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045197934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:06,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:06,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:04:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221677816] [2022-04-28 10:04:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) 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 20 [2022-04-28 10:04:06,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:06,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) 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-28 10:04:06,276 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-28 10:04:06,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:04:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:04:06,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:04:06,277 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.875) 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-28 10:04:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,598 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 10:04:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:04:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) 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 20 [2022-04-28 10:04:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) 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-28 10:04:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 10:04:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) 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-28 10:04:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 10:04:06,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 10:04:06,631 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-28 10:04:06,632 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:04:06,632 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:04:06,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:04:06,633 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:06,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 44 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:04:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-04-28 10:04:06,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:06,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:06,676 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:06,676 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,677 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:04:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 10:04:06,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 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-28 10:04:06,677 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 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-28 10:04:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,678 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:04:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 10:04:06,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:06,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-28 10:04:06,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-04-28 10:04:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:06,680 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-28 10:04:06,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) 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-28 10:04:06,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-28 10:04:06,735 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-28 10:04:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-28 10:04:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:04:06,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:06,736 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:06,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 10:04:06,937 WARN L477 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-28 10:04:06,937 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -930628562, now seen corresponding path program 11 times [2022-04-28 10:04:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948283715] [2022-04-28 10:04:06,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:06,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash -930628562, now seen corresponding path program 12 times [2022-04-28 10:04:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:06,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693570181] [2022-04-28 10:04:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {2509#(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); {2498#true} is VALID [2022-04-28 10:04:07,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-28 10:04:07,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-28 10:04:07,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:07,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#(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); {2498#true} is VALID [2022-04-28 10:04:07,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-28 10:04:07,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-28 10:04:07,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-28 10:04:07,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2503#(= main_~y~0 0)} is VALID [2022-04-28 10:04:07,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(= 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; {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:07,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2504#(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; {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:07,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2505#(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; {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2507#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:07,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#(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; {2508#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-28 10:04:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693570181] [2022-04-28 10:04:07,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693570181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:07,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415217464] [2022-04-28 10:04:07,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:07,057 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-28 10:04:07,058 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-28 10:04:07,096 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:07,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:07,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:04:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:07,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2498#true} is VALID [2022-04-28 10:04:07,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#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); {2498#true} is VALID [2022-04-28 10:04:07,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-28 10:04:07,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-28 10:04:07,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-28 10:04:07,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2503#(= main_~y~0 0)} is VALID [2022-04-28 10:04:07,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(= 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; {2504#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:07,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {2504#(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; {2505#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:07,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {2505#(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; {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {2506#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2543#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {2543#(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; {2547#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:07,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-28 10:04:07,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-28 10:04:07,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-28 10:04:07,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-28 10:04:07,225 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-28 10:04:07,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-28 10:04:07,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-28 10:04:07,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-28 10:04:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:07,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:07,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2022-04-28 10:04:07,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#false} assume 0 == ~cond; {2499#false} is VALID [2022-04-28 10:04:07,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#false} ~cond := #in~cond; {2499#false} is VALID [2022-04-28 10:04:07,337 INFO L272 TraceCheckUtils]: 16: Hoare triple {2499#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2499#false} is VALID [2022-04-28 10:04:07,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#false} assume !(~y~0 % 4294967296 > 0); {2499#false} is VALID [2022-04-28 10:04:07,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2587#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2499#false} is VALID [2022-04-28 10:04:07,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {2591#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2587#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:07,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2595#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2591#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2599#(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; {2595#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {2498#true} ~z~0 := ~y~0; {2599#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2498#true} assume !(~x~0 % 4294967296 > 0); {2498#true} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {2498#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; {2498#true} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {2498#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; {2498#true} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {2498#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; {2498#true} is VALID [2022-04-28 10:04:07,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {2498#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret11 := main(); {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #61#return; {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2498#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); {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2498#true} is VALID [2022-04-28 10:04:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:07,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415217464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:07,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:07,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:04:07,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:07,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948283715] [2022-04-28 10:04:07,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948283715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:07,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:07,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:04:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694393802] [2022-04-28 10:04:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:07,344 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 20 [2022-04-28 10:04:07,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:07,344 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-28 10:04:07,358 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-28 10:04:07,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:04:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:07,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:04:07,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:04:07,359 INFO L87 Difference]: Start difference. First operand 33 states and 40 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-28 10:04:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,779 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 10:04:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:04:07,779 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 20 [2022-04-28 10:04:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:07,780 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-28 10:04:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-28 10:04:07,781 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-28 10:04:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-28 10:04:07,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-28 10:04:07,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:07,828 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:04:07,828 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:04:07,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 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-28 10:04:07,829 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:07,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 46 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:04:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-04-28 10:04:07,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:07,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:07,900 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:07,900 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,902 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 10:04:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 10:04:07,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:07,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:07,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 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 47 states. [2022-04-28 10:04:07,902 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 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 47 states. [2022-04-28 10:04:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,904 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 10:04:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 10:04:07,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:07,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:07,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:07,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-04-28 10:04:07,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 20 [2022-04-28 10:04:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:07,906 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-04-28 10:04:07,907 INFO L496 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-28 10:04:07,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 48 transitions. [2022-04-28 10:04:07,968 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-28 10:04:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-28 10:04:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:04:07,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:07,969 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:07,999 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-28 10:04:08,169 WARN L477 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-28 10:04:08,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 13 times [2022-04-28 10:04:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:08,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513049368] [2022-04-28 10:04:08,174 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:08,174 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 14 times [2022-04-28 10:04:08,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:08,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400373253] [2022-04-28 10:04:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:08,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {2942#(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); {2931#true} is VALID [2022-04-28 10:04:08,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-28 10:04:08,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-28 10:04:08,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:08,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#(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); {2931#true} is VALID [2022-04-28 10:04:08,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-28 10:04:08,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-28 10:04:08,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-28 10:04:08,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#(= main_~y~0 0)} is VALID [2022-04-28 10:04:08,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#(= 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; {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:08,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(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; {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2939#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:08,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {2939#(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; {2940#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:08,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {2940#(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; {2941#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {2941#(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; {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#false} assume !(~z~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#false} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-28 10:04:08,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-28 10:04:08,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-28 10:04:08,327 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-28 10:04:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:08,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400373253] [2022-04-28 10:04:08,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400373253] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:08,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768618253] [2022-04-28 10:04:08,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:08,328 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-28 10:04:08,353 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-28 10:04:08,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:08,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:08,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:04:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:08,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:08,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2931#true} is VALID [2022-04-28 10:04:08,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#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); {2931#true} is VALID [2022-04-28 10:04:08,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-28 10:04:08,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-28 10:04:08,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-28 10:04:08,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#(= main_~y~0 0)} is VALID [2022-04-28 10:04:08,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#(= 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; {2937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:08,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {2937#(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; {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2973#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(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; {2977#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:08,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {2977#(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; {2981#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:04:08,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {2981#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ 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; {2932#false} is VALID [2022-04-28 10:04:08,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#false} assume !(~z~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-28 10:04:08,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-28 10:04:08,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2932#false} is VALID [2022-04-28 10:04:08,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#false} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-28 10:04:08,540 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-28 10:04:08,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-28 10:04:08,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-28 10:04:08,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-28 10:04:08,541 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-28 10:04:08,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:08,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#false} assume !false; {2932#false} is VALID [2022-04-28 10:04:08,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#false} assume 0 == ~cond; {2932#false} is VALID [2022-04-28 10:04:08,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#false} ~cond := #in~cond; {2932#false} is VALID [2022-04-28 10:04:08,744 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2932#false} is VALID [2022-04-28 10:04:08,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {3021#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2932#false} is VALID [2022-04-28 10:04:08,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {3025#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3021#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:08,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3025#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:08,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:08,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(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; {3029#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:08,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {3040#(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; {3036#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:04:08,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {3044#(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; {3040#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:08,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2931#true} ~z~0 := ~y~0; {3044#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:08,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2931#true} assume !(~x~0 % 4294967296 > 0); {2931#true} is VALID [2022-04-28 10:04:08,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2931#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; {2931#true} is VALID [2022-04-28 10:04:08,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {2931#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; {2931#true} is VALID [2022-04-28 10:04:08,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {2931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2931#true} is VALID [2022-04-28 10:04:08,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {2931#true} call #t~ret11 := main(); {2931#true} is VALID [2022-04-28 10:04:08,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2931#true} {2931#true} #61#return; {2931#true} is VALID [2022-04-28 10:04:08,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {2931#true} assume true; {2931#true} is VALID [2022-04-28 10:04:08,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {2931#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); {2931#true} is VALID [2022-04-28 10:04:08,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {2931#true} call ULTIMATE.init(); {2931#true} is VALID [2022-04-28 10:04:08,751 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-28 10:04:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768618253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:08,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 10:04:08,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:08,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513049368] [2022-04-28 10:04:08,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513049368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:08,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:08,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:04:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245512029] [2022-04-28 10:04:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:08,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:08,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:08,770 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-28 10:04:08,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:04:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:04:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:04:08,771 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:09,098 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:04:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:04:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-28 10:04:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-28 10:04:09,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-28 10:04:09,132 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-28 10:04:09,133 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:04:09,133 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:04:09,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:04:09,134 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:09,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:04:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 10:04:09,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:09,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:09,181 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:09,181 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:09,181 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:04:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:04:09,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:09,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:09,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 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 34 states. [2022-04-28 10:04:09,182 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 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 34 states. [2022-04-28 10:04:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:09,183 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:04:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:04:09,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:09,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:09,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:09,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-28 10:04:09,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2022-04-28 10:04:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:09,184 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-28 10:04:09,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 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-28 10:04:09,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-28 10:04:09,236 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-28 10:04:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:04:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:04:09,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:09,236 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:09,262 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-28 10:04:09,437 WARN L477 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-28 10:04:09,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 671734479, now seen corresponding path program 15 times [2022-04-28 10:04:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560389314] [2022-04-28 10:04:09,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:09,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash 671734479, now seen corresponding path program 16 times [2022-04-28 10:04:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:09,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696748959] [2022-04-28 10:04:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {3331#(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); {3319#true} is VALID [2022-04-28 10:04:09,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-28 10:04:09,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-28 10:04:09,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:09,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {3331#(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); {3319#true} is VALID [2022-04-28 10:04:09,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-28 10:04:09,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-28 10:04:09,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-28 10:04:09,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3324#(= main_~y~0 0)} is VALID [2022-04-28 10:04:09,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#(= 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; {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:09,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {3325#(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; {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:09,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(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; {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {3327#(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; {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:09,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:09,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3329#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:09,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {3329#(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; {3330#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {3330#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-28 10:04:09,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-28 10:04:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:09,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696748959] [2022-04-28 10:04:09,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696748959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:09,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612934811] [2022-04-28 10:04:09,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:09,578 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-28 10:04:09,601 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-28 10:04:09,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:09,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:09,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:04:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:09,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3319#true} is VALID [2022-04-28 10:04:09,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#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); {3319#true} is VALID [2022-04-28 10:04:09,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-28 10:04:09,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-28 10:04:09,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-28 10:04:09,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3324#(= main_~y~0 0)} is VALID [2022-04-28 10:04:09,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {3324#(= 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; {3325#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:09,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {3325#(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; {3326#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:09,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {3326#(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; {3327#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {3327#(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; {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:09,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:09,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {3328#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3368#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:09,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {3368#(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; {3372#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {3372#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {3320#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-28 10:04:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:09,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:09,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {3320#false} assume !false; {3320#false} is VALID [2022-04-28 10:04:09,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#false} assume 0 == ~cond; {3320#false} is VALID [2022-04-28 10:04:09,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {3320#false} ~cond := #in~cond; {3320#false} is VALID [2022-04-28 10:04:09,908 INFO L272 TraceCheckUtils]: 17: Hoare triple {3320#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3320#false} is VALID [2022-04-28 10:04:09,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {3320#false} assume !(~y~0 % 4294967296 > 0); {3320#false} is VALID [2022-04-28 10:04:09,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {3412#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#false} is VALID [2022-04-28 10:04:09,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {3416#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:09,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {3420#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3416#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:09,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3424#(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; {3420#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {3319#true} ~z~0 := ~y~0; {3424#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {3319#true} assume !(~x~0 % 4294967296 > 0); {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {3319#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; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#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; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3319#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; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {3319#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; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {3319#true} call #t~ret11 := main(); {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3319#true} {3319#true} #61#return; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {3319#true} assume true; {3319#true} is VALID [2022-04-28 10:04:09,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {3319#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); {3319#true} is VALID [2022-04-28 10:04:09,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3319#true} call ULTIMATE.init(); {3319#true} is VALID [2022-04-28 10:04:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612934811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:09,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:04:09,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560389314] [2022-04-28 10:04:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560389314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:09,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:04:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980298978] [2022-04-28 10:04:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:09,915 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 21 [2022-04-28 10:04:09,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:09,915 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-28 10:04:09,930 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-28 10:04:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:04:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:04:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:04:09,931 INFO L87 Difference]: Start difference. First operand 34 states and 41 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-28 10:04:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,446 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 10:04:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:10,446 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 21 [2022-04-28 10:04:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:10,447 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-28 10:04:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-28 10:04:10,448 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-28 10:04:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-28 10:04:10,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-28 10:04:10,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:10,492 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:04:10,492 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:04:10,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 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-28 10:04:10,493 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:10,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:04:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-04-28 10:04:10,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:10,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-28 10:04:10,553 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-28 10:04:10,553 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-28 10:04:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,554 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 10:04:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 10:04:10,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 49 states. [2022-04-28 10:04:10,555 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 49 states. [2022-04-28 10:04:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,556 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 10:04:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 10:04:10,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:10,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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-28 10:04:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 10:04:10,557 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2022-04-28 10:04:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:10,558 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 10:04:10,558 INFO L496 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-28 10:04:10,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 10:04:10,626 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-28 10:04:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 10:04:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:10,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:10,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:10,655 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-28 10:04:10,838 WARN L477 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-28 10:04:10,838 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 17 times [2022-04-28 10:04:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:10,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736493745] [2022-04-28 10:04:10,841 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:10,841 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 18 times [2022-04-28 10:04:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:10,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80971222] [2022-04-28 10:04:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:10,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:10,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {3783#(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); {3771#true} is VALID [2022-04-28 10:04:10,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 10:04:10,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-28 10:04:10,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:10,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {3783#(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); {3771#true} is VALID [2022-04-28 10:04:10,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 10:04:10,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-28 10:04:10,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-28 10:04:10,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3776#(= main_~y~0 0)} is VALID [2022-04-28 10:04:10,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {3776#(= 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; {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:10,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {3777#(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; {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:10,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {3778#(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; {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:10,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:10,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3780#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:10,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {3780#(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; {3781#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:10,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {3781#(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; {3782#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:10,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {3782#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-28 10:04:10,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:10,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:10,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 10:04:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80971222] [2022-04-28 10:04:10,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80971222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:10,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780241061] [2022-04-28 10:04:10,967 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:10,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:10,968 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-28 10:04:10,977 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-28 10:04:11,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:11,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:11,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:04:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:11,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:11,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3771#true} is VALID [2022-04-28 10:04:11,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#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); {3771#true} is VALID [2022-04-28 10:04:11,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 10:04:11,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-28 10:04:11,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-28 10:04:11,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3776#(= main_~y~0 0)} is VALID [2022-04-28 10:04:11,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {3776#(= 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; {3777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:11,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {3777#(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; {3778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:11,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {3778#(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; {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:11,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:11,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3817#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:11,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {3817#(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; {3821#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {3821#(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; {3825#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {3825#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {3772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-28 10:04:11,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-28 10:04:11,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 10:04:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:11,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:11,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 10:04:11,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {3772#false} assume 0 == ~cond; {3772#false} is VALID [2022-04-28 10:04:11,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#false} ~cond := #in~cond; {3772#false} is VALID [2022-04-28 10:04:11,354 INFO L272 TraceCheckUtils]: 18: Hoare triple {3772#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3772#false} is VALID [2022-04-28 10:04:11,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {3772#false} assume !(~y~0 % 4294967296 > 0); {3772#false} is VALID [2022-04-28 10:04:11,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {3868#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3772#false} is VALID [2022-04-28 10:04:11,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {3872#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3868#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:11,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {3876#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3872#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:11,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {3880#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3876#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:11,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {3884#(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; {3880#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {3888#(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; {3884#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {3771#true} ~z~0 := ~y~0; {3888#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {3771#true} assume !(~x~0 % 4294967296 > 0); {3771#true} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#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; {3771#true} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {3771#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; {3771#true} is VALID [2022-04-28 10:04:11,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#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; {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret11 := main(); {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #61#return; {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#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); {3771#true} is VALID [2022-04-28 10:04:11,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3771#true} is VALID [2022-04-28 10:04:11,360 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-28 10:04:11,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780241061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:11,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:11,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-28 10:04:11,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:11,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736493745] [2022-04-28 10:04:11,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736493745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:11,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:11,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:04:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586473658] [2022-04-28 10:04:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:11,361 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 22 [2022-04-28 10:04:11,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:11,362 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-28 10:04:11,393 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-28 10:04:11,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:04:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:04:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:04:11,394 INFO L87 Difference]: Start difference. First operand 40 states and 49 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-28 10:04:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:11,877 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-28 10:04:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:04:11,877 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 22 [2022-04-28 10:04:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:11,878 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-28 10:04:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:04:11,879 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-28 10:04:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:04:11,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 10:04:11,917 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-28 10:04:11,918 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:04:11,918 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:04:11,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:11,919 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:11,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:04:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-04-28 10:04:11,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:11,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:11,990 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:11,991 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:11,991 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 10:04:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 10:04:11,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:11,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:11,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 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 46 states. [2022-04-28 10:04:11,992 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 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 46 states. [2022-04-28 10:04:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:11,993 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 10:04:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 10:04:11,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:11,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:11,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:11,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 10:04:11,994 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 10:04:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:11,994 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 10:04:11,994 INFO L496 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-28 10:04:11,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 10:04:12,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 10:04:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:12,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:12,058 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:12,075 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-28 10:04:12,259 WARN L477 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-28 10:04:12,259 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1194618802, now seen corresponding path program 19 times [2022-04-28 10:04:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:12,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331520719] [2022-04-28 10:04:12,265 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:12,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1194618802, now seen corresponding path program 20 times [2022-04-28 10:04:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364800003] [2022-04-28 10:04:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:12,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:12,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {4235#(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); {4222#true} is VALID [2022-04-28 10:04:12,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-28 10:04:12,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-28 10:04:12,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:12,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {4235#(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); {4222#true} is VALID [2022-04-28 10:04:12,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-28 10:04:12,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-28 10:04:12,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-28 10:04:12,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4227#(= main_~y~0 0)} is VALID [2022-04-28 10:04:12,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#(= 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; {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:12,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#(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; {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:12,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {4229#(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; {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:12,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#(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; {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:12,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {4231#(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; {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:12,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:12,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:12,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(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; {4234#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {4234#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-28 10:04:12,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-28 10:04:12,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-28 10:04:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:12,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364800003] [2022-04-28 10:04:12,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364800003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:12,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948603979] [2022-04-28 10:04:12,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:12,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:12,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:12,423 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-28 10:04:12,423 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-28 10:04:12,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:12,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:12,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:04:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:12,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:12,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2022-04-28 10:04:12,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#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); {4222#true} is VALID [2022-04-28 10:04:12,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-28 10:04:12,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-28 10:04:12,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-28 10:04:12,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4227#(= main_~y~0 0)} is VALID [2022-04-28 10:04:12,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#(= 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; {4228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:12,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#(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; {4229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:12,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {4229#(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; {4230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:12,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#(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; {4231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:12,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {4231#(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; {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:12,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:12,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {4232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4233#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:12,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(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; {4278#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {4278#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-28 10:04:12,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-28 10:04:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:12,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:12,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#false} assume !false; {4223#false} is VALID [2022-04-28 10:04:12,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {4223#false} assume 0 == ~cond; {4223#false} is VALID [2022-04-28 10:04:12,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {4223#false} ~cond := #in~cond; {4223#false} is VALID [2022-04-28 10:04:12,896 INFO L272 TraceCheckUtils]: 18: Hoare triple {4223#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4223#false} is VALID [2022-04-28 10:04:12,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {4223#false} assume !(~y~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {4223#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4223#false} is VALID [2022-04-28 10:04:12,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4223#false} is VALID [2022-04-28 10:04:12,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {4328#(< 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; {4324#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:12,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {4328#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:12,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:12,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {4339#(< 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; {4332#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:12,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {4343#(< 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; {4339#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:12,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {4347#(< 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; {4343#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:12,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {4351#(< 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; {4347#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:12,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {4355#(< 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; {4351#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:12,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {4222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4355#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:12,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {4222#true} call #t~ret11 := main(); {4222#true} is VALID [2022-04-28 10:04:12,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4222#true} {4222#true} #61#return; {4222#true} is VALID [2022-04-28 10:04:12,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {4222#true} assume true; {4222#true} is VALID [2022-04-28 10:04:12,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {4222#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); {4222#true} is VALID [2022-04-28 10:04:12,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {4222#true} call ULTIMATE.init(); {4222#true} is VALID [2022-04-28 10:04:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:12,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948603979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:12,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:12,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:04:12,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331520719] [2022-04-28 10:04:12,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331520719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:12,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:12,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499210935] [2022-04-28 10:04:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:12,906 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 22 [2022-04-28 10:04:12,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:12,906 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-28 10:04:12,924 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-28 10:04:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:12,926 INFO L87 Difference]: Start difference. First operand 41 states and 50 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-28 10:04:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:13,595 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-28 10:04:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:04:13,595 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 22 [2022-04-28 10:04:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:13,595 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-28 10:04:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 10:04:13,596 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-28 10:04:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 10:04:13,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-28 10:04:13,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:13,650 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:04:13,650 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:04:13,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:04:13,651 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:13,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:04:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-04-28 10:04:13,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:13,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:13,749 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:13,749 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:13,751 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-28 10:04:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 10:04:13,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:13,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:13,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 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 57 states. [2022-04-28 10:04:13,751 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 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 57 states. [2022-04-28 10:04:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:13,752 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-28 10:04:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 10:04:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:13,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:13,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:13,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 10:04:13,754 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 22 [2022-04-28 10:04:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:13,754 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 10:04:13,754 INFO L496 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-28 10:04:13,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 10:04:13,837 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-28 10:04:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 10:04:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:13,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:13,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:13,863 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-28 10:04:14,038 WARN L477 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-28 10:04:14,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 21 times [2022-04-28 10:04:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415629995] [2022-04-28 10:04:14,042 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:14,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:14,042 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 22 times [2022-04-28 10:04:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:14,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76677397] [2022-04-28 10:04:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:14,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {4743#(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); {4732#true} is VALID [2022-04-28 10:04:14,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 10:04:14,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-28 10:04:14,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:14,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {4743#(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); {4732#true} is VALID [2022-04-28 10:04:14,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 10:04:14,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= 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; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= 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; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= 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; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4741#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:14,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {4741#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4742#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:14,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {4742#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4733#false} is VALID [2022-04-28 10:04:14,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-28 10:04:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76677397] [2022-04-28 10:04:14,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76677397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:14,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153257033] [2022-04-28 10:04:14,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:14,170 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-28 10:04:14,171 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-28 10:04:14,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:14,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:14,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:04:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:14,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#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); {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= 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; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= 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; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= 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; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,489 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:14,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:14,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {4808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4733#false} is VALID [2022-04-28 10:04:14,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-28 10:04:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:14,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:14,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#false} assume !false; {4733#false} is VALID [2022-04-28 10:04:14,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {4808#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4733#false} is VALID [2022-04-28 10:04:14,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4808#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:14,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4804#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:14,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(<= 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; {4740#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(<= 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; {4739#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:14,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {4737#(<= 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; {4738#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:14,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} assume !(~x~0 % 4294967296 > 0); {4737#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {4732#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; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} call #t~ret11 := main(); {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} #61#return; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} assume true; {4732#true} is VALID [2022-04-28 10:04:14,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#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); {4732#true} is VALID [2022-04-28 10:04:14,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} call ULTIMATE.init(); {4732#true} is VALID [2022-04-28 10:04:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153257033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:14,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-28 10:04:14,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415629995] [2022-04-28 10:04:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415629995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:14,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:14,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:04:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940099602] [2022-04-28 10:04:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:14,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:14,788 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), 7 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-28 10:04:14,808 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-28 10:04:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:04:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:04:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:04:14,809 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:15,365 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-28 10:04:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:04:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 10:04:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 10:04:15,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 10:04:15,408 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-28 10:04:15,409 INFO L225 Difference]: With dead ends: 80 [2022-04-28 10:04:15,409 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 10:04:15,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:04:15,410 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:15,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 10:04:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2022-04-28 10:04:15,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:15,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:15,509 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:15,509 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:15,510 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-28 10:04:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-28 10:04:15,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:15,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:15,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 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 71 states. [2022-04-28 10:04:15,511 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 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 71 states. [2022-04-28 10:04:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:15,512 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-28 10:04:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-28 10:04:15,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:15,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:15,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:15,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-04-28 10:04:15,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 23 [2022-04-28 10:04:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:15,514 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-04-28 10:04:15,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 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-28 10:04:15,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 64 transitions. [2022-04-28 10:04:15,607 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-28 10:04:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:04:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:15,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:15,608 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:15,633 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-28 10:04:15,808 WARN L477 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-28 10:04:15,808 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1077971631, now seen corresponding path program 23 times [2022-04-28 10:04:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:15,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449485540] [2022-04-28 10:04:15,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:15,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1077971631, now seen corresponding path program 24 times [2022-04-28 10:04:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177677318] [2022-04-28 10:04:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:15,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {5313#(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); {5299#true} is VALID [2022-04-28 10:04:15,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-28 10:04:15,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-28 10:04:15,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:15,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {5313#(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); {5299#true} is VALID [2022-04-28 10:04:15,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-28 10:04:15,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-28 10:04:15,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-28 10:04:15,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5304#(= main_~y~0 0)} is VALID [2022-04-28 10:04:15,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {5304#(= 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; {5305#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:15,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {5305#(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; {5306#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:15,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {5306#(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; {5307#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:15,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {5307#(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; {5308#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:15,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#(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; {5309#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:15,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {5309#(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; {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:15,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:15,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {5310#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5311#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {5311#(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; {5312#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {5312#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {5300#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {5300#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-28 10:04:15,980 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-28 10:04:15,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-28 10:04:15,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-28 10:04:15,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-28 10:04:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177677318] [2022-04-28 10:04:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177677318] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999007014] [2022-04-28 10:04:15,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:15,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:15,983 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-28 10:04:16,012 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-28 10:04:16,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:16,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:16,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:04:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:16,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:16,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2022-04-28 10:04:16,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#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); {5299#true} is VALID [2022-04-28 10:04:16,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-28 10:04:16,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-28 10:04:16,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#true} assume !(~x~0 % 4294967296 > 0); {5299#true} is VALID [2022-04-28 10:04:16,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {5299#true} ~z~0 := ~y~0; {5356#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:04:16,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {5356#(= 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; {5360#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:04:16,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {5360#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:16,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:16,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-28 10:04:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:16,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:16,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2022-04-28 10:04:16,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {5300#false} assume 0 == ~cond; {5300#false} is VALID [2022-04-28 10:04:16,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2022-04-28 10:04:16,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {5300#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5300#false} is VALID [2022-04-28 10:04:16,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {5300#false} assume !(~y~0 % 4294967296 > 0); {5300#false} is VALID [2022-04-28 10:04:16,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5300#false} is VALID [2022-04-28 10:04:16,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:16,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {5408#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5364#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {5412#(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; {5408#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {5299#true} ~z~0 := ~y~0; {5412#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {5299#true} assume !(~x~0 % 4294967296 > 0); {5299#true} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {5299#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; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {5299#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret11 := main(); {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #61#return; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#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); {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2022-04-28 10:04:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999007014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:16,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:16,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2022-04-28 10:04:16,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:16,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449485540] [2022-04-28 10:04:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449485540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:16,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:16,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631103615] [2022-04-28 10:04:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:16,276 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 23 [2022-04-28 10:04:16,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:16,276 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-28 10:04:16,301 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-28 10:04:16,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:04:16,302 INFO L87 Difference]: Start difference. First operand 51 states and 64 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-28 10:04:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:17,121 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2022-04-28 10:04:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:17,121 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 23 [2022-04-28 10:04:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:17,122 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-28 10:04:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 10:04:17,123 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-28 10:04:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 10:04:17,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-28 10:04:17,176 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-28 10:04:17,177 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:04:17,178 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 10:04:17,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:17,179 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:17,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 10:04:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-04-28 10:04:17,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:17,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:17,286 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:17,286 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:17,287 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-28 10:04:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-04-28 10:04:17,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:17,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:17,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 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-28 10:04:17,288 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 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-28 10:04:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:17,289 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-28 10:04:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2022-04-28 10:04:17,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:17,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:17,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:17,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-04-28 10:04:17,290 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 23 [2022-04-28 10:04:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:17,290 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-04-28 10:04:17,291 INFO L496 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-28 10:04:17,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 72 transitions. [2022-04-28 10:04:17,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-28 10:04:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:17,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:17,378 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:17,395 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-28 10:04:17,583 WARN L477 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-28 10:04:17,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 25 times [2022-04-28 10:04:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46426929] [2022-04-28 10:04:17,586 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:17,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 26 times [2022-04-28 10:04:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:17,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955914566] [2022-04-28 10:04:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(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); {5899#true} is VALID [2022-04-28 10:04:17,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-28 10:04:17,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-28 10:04:17,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:17,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(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); {5899#true} is VALID [2022-04-28 10:04:17,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-28 10:04:17,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-28 10:04:17,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-28 10:04:17,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5904#(= main_~y~0 0)} is VALID [2022-04-28 10:04:17,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#(= 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; {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:17,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(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; {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:17,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(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; {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5908#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:17,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {5908#(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; {5909#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:17,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {5909#(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; {5910#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:17,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(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; {5911#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:04:17,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {5911#(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; {5900#false} is VALID [2022-04-28 10:04:17,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#false} assume !(~z~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#false} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-28 10:04:17,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-28 10:04:17,719 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-28 10:04:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955914566] [2022-04-28 10:04:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955914566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326918577] [2022-04-28 10:04:17,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:17,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:17,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:17,725 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-28 10:04:17,726 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-28 10:04:17,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:17,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:17,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:04:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:17,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:17,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5899#true} is VALID [2022-04-28 10:04:17,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#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); {5899#true} is VALID [2022-04-28 10:04:17,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-28 10:04:17,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-28 10:04:17,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-28 10:04:17,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5904#(= main_~y~0 0)} is VALID [2022-04-28 10:04:17,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {5904#(= 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; {5905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:17,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(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; {5906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:17,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(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; {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {5907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5946#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {5946#(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; {5950#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:17,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {5950#(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; {5954#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {5954#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {5958#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {5958#(and (<= main_~y~0 3) (<= 3 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; {5900#false} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#false} assume !(~z~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {5900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5900#false} is VALID [2022-04-28 10:04:17,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {5900#false} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-28 10:04:17,960 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-28 10:04:17,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-28 10:04:17,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-28 10:04:17,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-28 10:04:17,960 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-28 10:04:17,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:18,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {5900#false} assume !false; {5900#false} is VALID [2022-04-28 10:04:18,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#false} assume 0 == ~cond; {5900#false} is VALID [2022-04-28 10:04:18,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#false} ~cond := #in~cond; {5900#false} is VALID [2022-04-28 10:04:18,179 INFO L272 TraceCheckUtils]: 20: Hoare triple {5900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5900#false} is VALID [2022-04-28 10:04:18,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {6001#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5900#false} is VALID [2022-04-28 10:04:18,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {6005#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6001#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:18,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {6009#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6005#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:18,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6009#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:18,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:04:18,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {6020#(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; {6013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:04:18,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {6024#(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; {6020#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:18,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {6028#(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; {6024#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {6032#(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; {6028#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {5899#true} ~z~0 := ~y~0; {6032#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {5899#true} assume !(~x~0 % 4294967296 > 0); {5899#true} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {5899#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; {5899#true} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {5899#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; {5899#true} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {5899#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; {5899#true} is VALID [2022-04-28 10:04:18,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {5899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5899#true} is VALID [2022-04-28 10:04:18,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {5899#true} call #t~ret11 := main(); {5899#true} is VALID [2022-04-28 10:04:18,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5899#true} {5899#true} #61#return; {5899#true} is VALID [2022-04-28 10:04:18,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {5899#true} assume true; {5899#true} is VALID [2022-04-28 10:04:18,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {5899#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); {5899#true} is VALID [2022-04-28 10:04:18,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {5899#true} call ULTIMATE.init(); {5899#true} is VALID [2022-04-28 10:04:18,198 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-28 10:04:18,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326918577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:18,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:18,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 10:04:18,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46426929] [2022-04-28 10:04:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46426929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:18,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:18,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199926516] [2022-04-28 10:04:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) 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 24 [2022-04-28 10:04:18,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:18,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) 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-28 10:04:18,214 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-28 10:04:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:04:18,215 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) 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-28 10:04:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:18,645 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-28 10:04:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) 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 24 [2022-04-28 10:04:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) 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-28 10:04:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-28 10:04:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) 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-28 10:04:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2022-04-28 10:04:18,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2022-04-28 10:04:18,673 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-28 10:04:18,674 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:04:18,674 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:04:18,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:04:18,675 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:18,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:04:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 10:04:18,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:18,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:18,760 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:18,760 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:18,761 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 10:04:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:04:18,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:18,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:18,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 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 51 states. [2022-04-28 10:04:18,762 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 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 51 states. [2022-04-28 10:04:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:18,762 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 10:04:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:04:18,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:18,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:18,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:18,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-04-28 10:04:18,764 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 24 [2022-04-28 10:04:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:18,764 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-04-28 10:04:18,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) 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-28 10:04:18,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 64 transitions. [2022-04-28 10:04:18,854 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-28 10:04:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:04:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:18,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:18,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:18,873 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-28 10:04:19,063 WARN L477 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-28 10:04:19,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:19,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 27 times [2022-04-28 10:04:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:19,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664594653] [2022-04-28 10:04:19,067 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:19,067 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 28 times [2022-04-28 10:04:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748781014] [2022-04-28 10:04:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:19,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {6433#(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); {6420#true} is VALID [2022-04-28 10:04:19,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-28 10:04:19,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-28 10:04:19,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:19,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {6433#(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); {6420#true} is VALID [2022-04-28 10:04:19,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-28 10:04:19,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-28 10:04:19,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-28 10:04:19,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6425#(= main_~y~0 0)} is VALID [2022-04-28 10:04:19,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#(= 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; {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:19,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {6426#(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; {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:19,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {6427#(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; {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:19,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#(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; {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:19,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#(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; {6431#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {6431#(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; {6432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {6432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-28 10:04:19,201 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-28 10:04:19,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-28 10:04:19,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-28 10:04:19,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-28 10:04:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:19,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748781014] [2022-04-28 10:04:19,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748781014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:19,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016841855] [2022-04-28 10:04:19,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:19,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:19,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:19,203 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-28 10:04:19,221 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-28 10:04:19,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:19,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:19,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:04:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:19,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6420#true} is VALID [2022-04-28 10:04:19,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#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); {6420#true} is VALID [2022-04-28 10:04:19,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-28 10:04:19,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-28 10:04:19,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-28 10:04:19,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6425#(= main_~y~0 0)} is VALID [2022-04-28 10:04:19,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {6425#(= 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; {6426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:19,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {6426#(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; {6427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:19,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {6427#(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; {6428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:19,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#(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; {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {6429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6470#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {6470#(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; {6474#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {6474#(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; {6478#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {6478#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-28 10:04:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:19,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#false} assume !false; {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {6421#false} assume 0 == ~cond; {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {6421#false} ~cond := #in~cond; {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L272 TraceCheckUtils]: 20: Hoare triple {6421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {6421#false} assume !(~y~0 % 4294967296 > 0); {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {6421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {6527#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6421#false} is VALID [2022-04-28 10:04:19,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {6531#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6527#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:19,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {6535#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6531#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:19,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {6539#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6535#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:19,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {6543#(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; {6539#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:19,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {6547#(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; {6543#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:19,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {6420#true} ~z~0 := ~y~0; {6547#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:19,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {6420#true} assume !(~x~0 % 4294967296 > 0); {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {6420#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; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {6420#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; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {6420#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; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {6420#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; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {6420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {6420#true} call #t~ret11 := main(); {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6420#true} {6420#true} #61#return; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {6420#true} assume true; {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {6420#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); {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {6420#true} call ULTIMATE.init(); {6420#true} is VALID [2022-04-28 10:04:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:04:19,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016841855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:19,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-28 10:04:19,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:19,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664594653] [2022-04-28 10:04:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664594653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:19,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:19,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518789981] [2022-04-28 10:04:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:19,606 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 24 [2022-04-28 10:04:19,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:19,606 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-28 10:04:19,621 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-28 10:04:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:19,622 INFO L87 Difference]: Start difference. First operand 51 states and 64 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-28 10:04:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:20,089 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-28 10:04:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:20,089 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 24 [2022-04-28 10:04:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:20,090 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-28 10:04:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 10:04:20,090 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-28 10:04:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 10:04:20,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 10:04:20,128 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-28 10:04:20,128 INFO L225 Difference]: With dead ends: 68 [2022-04-28 10:04:20,129 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 10:04:20,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:20,129 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:20,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 10:04:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-28 10:04:20,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:20,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-28 10:04:20,224 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-28 10:04:20,224 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-28 10:04:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:20,225 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 10:04:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-28 10:04:20,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:20,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:20,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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 58 states. [2022-04-28 10:04:20,226 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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 58 states. [2022-04-28 10:04:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:20,227 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 10:04:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-28 10:04:20,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:20,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:20,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:20,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 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-28 10:04:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-04-28 10:04:20,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 24 [2022-04-28 10:04:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:20,229 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-04-28 10:04:20,229 INFO L496 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-28 10:04:20,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 65 transitions. [2022-04-28 10:04:20,321 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-28 10:04:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-28 10:04:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:20,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:20,322 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:20,339 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-28 10:04:20,527 WARN L477 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-28 10:04:20,527 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1486168978, now seen corresponding path program 29 times [2022-04-28 10:04:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:20,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525924589] [2022-04-28 10:04:20,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:20,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1486168978, now seen corresponding path program 30 times [2022-04-28 10:04:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:20,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100884862] [2022-04-28 10:04:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {6973#(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); {6958#true} is VALID [2022-04-28 10:04:20,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-28 10:04:20,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-28 10:04:20,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:20,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {6973#(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); {6958#true} is VALID [2022-04-28 10:04:20,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-28 10:04:20,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-28 10:04:20,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-28 10:04:20,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6963#(= main_~y~0 0)} is VALID [2022-04-28 10:04:20,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {6963#(= 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; {6964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:20,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {6964#(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; {6965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:20,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {6965#(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; {6966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:20,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {6966#(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; {6967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:20,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {6967#(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; {6968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:20,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {6968#(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; {6969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:20,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {6969#(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; {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:20,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:20,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {6970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6971#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {6971#(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; {6972#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {6972#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {6959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {6959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-28 10:04:20,681 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-28 10:04:20,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-28 10:04:20,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-28 10:04:20,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-28 10:04:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100884862] [2022-04-28 10:04:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100884862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277737848] [2022-04-28 10:04:20,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:20,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:20,683 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-28 10:04:20,685 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-28 10:04:20,718 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:20,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:20,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:04:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:20,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:20,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6958#true} is VALID [2022-04-28 10:04:20,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#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); {6958#true} is VALID [2022-04-28 10:04:20,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-28 10:04:20,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-28 10:04:20,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-28 10:04:20,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {6958#true} assume !(~x~0 % 4294967296 > 0); {6958#true} is VALID [2022-04-28 10:04:20,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#true} ~z~0 := ~y~0; {7019#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:04:20,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {7019#(= 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; {7023#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:04:20,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {7023#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:20,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7031#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:20,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-28 10:04:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:04:20,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:20,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {6959#false} assume !false; {6959#false} is VALID [2022-04-28 10:04:20,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {6959#false} assume 0 == ~cond; {6959#false} is VALID [2022-04-28 10:04:20,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {6959#false} ~cond := #in~cond; {6959#false} is VALID [2022-04-28 10:04:20,954 INFO L272 TraceCheckUtils]: 20: Hoare triple {6959#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#false} is VALID [2022-04-28 10:04:20,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {6959#false} assume !(~y~0 % 4294967296 > 0); {6959#false} is VALID [2022-04-28 10:04:20,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6959#false} is VALID [2022-04-28 10:04:20,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7031#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:20,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7027#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:20,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#(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; {7071#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:20,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#true} ~z~0 := ~y~0; {7075#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:20,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {6958#true} assume !(~x~0 % 4294967296 > 0); {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {6958#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; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {6958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {6958#true} call #t~ret11 := main(); {6958#true} is VALID [2022-04-28 10:04:20,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6958#true} {6958#true} #61#return; {6958#true} is VALID [2022-04-28 10:04:20,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {6958#true} assume true; {6958#true} is VALID [2022-04-28 10:04:20,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {6958#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); {6958#true} is VALID [2022-04-28 10:04:20,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {6958#true} call ULTIMATE.init(); {6958#true} is VALID [2022-04-28 10:04:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:04:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277737848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:20,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:20,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2022-04-28 10:04:20,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:20,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525924589] [2022-04-28 10:04:20,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525924589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:20,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:20,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440521752] [2022-04-28 10:04:20,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:20,959 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 24 [2022-04-28 10:04:20,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:20,960 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-28 10:04:20,988 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-28 10:04:20,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:20,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:20,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:04:20,991 INFO L87 Difference]: Start difference. First operand 52 states and 65 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-28 10:04:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:21,801 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2022-04-28 10:04:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:21,802 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 24 [2022-04-28 10:04:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:21,802 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-28 10:04:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-28 10:04:21,803 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-28 10:04:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-28 10:04:21,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2022-04-28 10:04:21,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:21,870 INFO L225 Difference]: With dead ends: 83 [2022-04-28 10:04:21,870 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 10:04:21,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:21,871 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:21,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 10:04:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2022-04-28 10:04:21,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:21,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:21,982 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:21,982 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:21,984 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-28 10:04:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-28 10:04:21,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:21,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:21,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 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 75 states. [2022-04-28 10:04:21,985 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 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 75 states. [2022-04-28 10:04:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:21,986 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-28 10:04:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-28 10:04:21,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:21,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:21,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:21,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2022-04-28 10:04:21,988 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 24 [2022-04-28 10:04:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:21,988 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2022-04-28 10:04:21,988 INFO L496 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-28 10:04:21,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 73 transitions. [2022-04-28 10:04:22,079 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-28 10:04:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2022-04-28 10:04:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:22,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:22,080 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:22,097 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-28 10:04:22,283 WARN L477 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-28 10:04:22,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 31 times [2022-04-28 10:04:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:22,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504388495] [2022-04-28 10:04:22,286 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:22,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 32 times [2022-04-28 10:04:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:22,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378172205] [2022-04-28 10:04:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {7591#(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); {7577#true} is VALID [2022-04-28 10:04:22,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-28 10:04:22,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-28 10:04:22,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:22,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {7591#(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); {7577#true} is VALID [2022-04-28 10:04:22,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-28 10:04:22,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-28 10:04:22,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-28 10:04:22,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7582#(= main_~y~0 0)} is VALID [2022-04-28 10:04:22,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(= 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; {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:22,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(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; {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:22,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(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; {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:22,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {7585#(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; {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:22,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {7587#(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; {7588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:22,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {7588#(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; {7589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:22,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {7589#(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; {7590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {7590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-28 10:04:22,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-28 10:04:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378172205] [2022-04-28 10:04:22,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378172205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53397542] [2022-04-28 10:04:22,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:22,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:22,436 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-28 10:04:22,439 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-28 10:04:22,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:22,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:22,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:04:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:22,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:22,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7577#true} is VALID [2022-04-28 10:04:22,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#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); {7577#true} is VALID [2022-04-28 10:04:22,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-28 10:04:22,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-28 10:04:22,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-28 10:04:22,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7582#(= main_~y~0 0)} is VALID [2022-04-28 10:04:22,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {7582#(= 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; {7583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:22,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(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; {7584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:22,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {7584#(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; {7585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:22,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {7585#(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; {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {7628#(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; {7632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:22,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {7632#(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; {7636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:22,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {7636#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {7640#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {7640#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-28 10:04:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:22,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:22,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#false} assume !false; {7578#false} is VALID [2022-04-28 10:04:22,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {7578#false} assume 0 == ~cond; {7578#false} is VALID [2022-04-28 10:04:22,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#false} ~cond := #in~cond; {7578#false} is VALID [2022-04-28 10:04:22,870 INFO L272 TraceCheckUtils]: 21: Hoare triple {7578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7578#false} is VALID [2022-04-28 10:04:22,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#false} assume !(~y~0 % 4294967296 > 0); {7578#false} is VALID [2022-04-28 10:04:22,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {7686#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#false} is VALID [2022-04-28 10:04:22,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {7690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7686#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:22,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {7694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:22,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {7698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:22,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {7702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:22,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {7706#(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; {7702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:22,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {7710#(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; {7706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {7714#(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; {7710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#true} ~z~0 := ~y~0; {7714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {7577#true} assume !(~x~0 % 4294967296 > 0); {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {7577#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; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {7577#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; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {7577#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; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {7577#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; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {7577#true} call #t~ret11 := main(); {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7577#true} {7577#true} #61#return; {7577#true} is VALID [2022-04-28 10:04:22,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-04-28 10:04:22,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#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); {7577#true} is VALID [2022-04-28 10:04:22,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {7577#true} call ULTIMATE.init(); {7577#true} is VALID [2022-04-28 10:04:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:22,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53397542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:22,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:22,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-28 10:04:22,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:22,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504388495] [2022-04-28 10:04:22,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504388495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:22,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:22,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839018522] [2022-04-28 10:04:22,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:22,878 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 25 [2022-04-28 10:04:22,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:22,878 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-28 10:04:22,892 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-28 10:04:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:04:22,893 INFO L87 Difference]: Start difference. First operand 58 states and 73 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-28 10:04:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:23,481 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 10:04:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:04:23,481 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 25 [2022-04-28 10:04:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:23,482 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-28 10:04:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 10:04:23,482 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-28 10:04:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 10:04:23,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 10:04:23,518 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-28 10:04:23,519 INFO L225 Difference]: With dead ends: 75 [2022-04-28 10:04:23,519 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:04:23,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:04:23,519 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:23,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:04:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-28 10:04:23,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:23,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,638 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,638 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:23,640 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-28 10:04:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-28 10:04:23,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:23,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:23,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,640 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:23,641 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-28 10:04:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-28 10:04:23,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:23,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:23,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:23,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 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-28 10:04:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-04-28 10:04:23,642 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 25 [2022-04-28 10:04:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:23,643 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-04-28 10:04:23,643 INFO L496 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-28 10:04:23,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 74 transitions. [2022-04-28 10:04:23,727 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-28 10:04:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-04-28 10:04:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:23,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:23,727 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:23,743 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-28 10:04:23,931 WARN L477 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-28 10:04:23,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 629850767, now seen corresponding path program 33 times [2022-04-28 10:04:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:23,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896509716] [2022-04-28 10:04:23,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:23,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 629850767, now seen corresponding path program 34 times [2022-04-28 10:04:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131630575] [2022-04-28 10:04:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:24,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:24,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {8185#(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); {8169#true} is VALID [2022-04-28 10:04:24,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 10:04:24,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-28 10:04:24,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:24,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {8185#(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); {8169#true} is VALID [2022-04-28 10:04:24,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 10:04:24,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-28 10:04:24,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-28 10:04:24,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8174#(= main_~y~0 0)} is VALID [2022-04-28 10:04:24,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {8174#(= 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; {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:24,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {8175#(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; {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:24,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {8176#(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; {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:24,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {8177#(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; {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:24,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {8178#(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; {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:24,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {8179#(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; {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:24,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {8180#(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; {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:24,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {8181#(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; {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:24,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:24,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:04:24,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {8183#(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; {8184#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {8184#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-28 10:04:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:24,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131630575] [2022-04-28 10:04:24,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131630575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856960107] [2022-04-28 10:04:24,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:24,128 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-28 10:04:24,130 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-28 10:04:24,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:24,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:24,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:24,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:24,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8169#true} is VALID [2022-04-28 10:04:24,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#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); {8169#true} is VALID [2022-04-28 10:04:24,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 10:04:24,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-28 10:04:24,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-28 10:04:24,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8174#(= main_~y~0 0)} is VALID [2022-04-28 10:04:24,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {8174#(= 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; {8175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:24,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {8175#(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; {8176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:24,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {8176#(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; {8177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:24,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {8177#(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; {8178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:24,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {8178#(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; {8179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:24,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {8179#(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; {8180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:24,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {8180#(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; {8181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:24,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {8181#(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; {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:24,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:24,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {8182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8183#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:04:24,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {8183#(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; {8237#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:04:24,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {8237#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,391 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-28 10:04:24,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-28 10:04:24,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-28 10:04:24,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-28 10:04:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:24,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {8170#false} assume 0 == ~cond; {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {8170#false} ~cond := #in~cond; {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L272 TraceCheckUtils]: 21: Hoare triple {8170#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !(~y~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {8170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8170#false} is VALID [2022-04-28 10:04:24,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {8283#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8170#false} is VALID [2022-04-28 10:04:24,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {8287#(< 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; {8283#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:24,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {8287#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:24,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:24,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {8298#(< 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; {8291#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:24,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {8302#(< 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; {8298#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:24,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {8306#(< 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; {8302#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:24,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {8310#(< 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; {8306#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:24,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {8314#(< 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; {8310#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:24,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {8318#(< 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; {8314#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:24,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {8322#(< 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; {8318#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:24,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {8326#(< 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; {8322#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:24,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8326#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:24,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret11 := main(); {8169#true} is VALID [2022-04-28 10:04:24,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #61#return; {8169#true} is VALID [2022-04-28 10:04:24,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-28 10:04:24,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#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); {8169#true} is VALID [2022-04-28 10:04:24,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8169#true} is VALID [2022-04-28 10:04:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:24,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856960107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:24,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:24,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:24,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896509716] [2022-04-28 10:04:24,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896509716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:24,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:24,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224826483] [2022-04-28 10:04:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:24,653 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 25 [2022-04-28 10:04:24,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:24,653 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-28 10:04:24,670 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-28 10:04:24,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:24,671 INFO L87 Difference]: Start difference. First operand 59 states and 74 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-28 10:04:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:25,662 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-04-28 10:04:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:25,663 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 25 [2022-04-28 10:04:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:25,663 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-28 10:04:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 10:04:25,664 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-28 10:04:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 10:04:25,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-28 10:04:25,729 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-28 10:04:25,730 INFO L225 Difference]: With dead ends: 91 [2022-04-28 10:04:25,730 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 10:04:25,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 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-28 10:04:25,731 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:25,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 75 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 10:04:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2022-04-28 10:04:25,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:25,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:25,860 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:25,860 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:25,861 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 10:04:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-28 10:04:25,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:25,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:25,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 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 83 states. [2022-04-28 10:04:25,861 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 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 83 states. [2022-04-28 10:04:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:25,862 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-28 10:04:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-28 10:04:25,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:25,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:25,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:25,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2022-04-28 10:04:25,864 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 25 [2022-04-28 10:04:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:25,864 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2022-04-28 10:04:25,864 INFO L496 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-28 10:04:25,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 82 transitions. [2022-04-28 10:04:25,984 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-28 10:04:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-04-28 10:04:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:04:25,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:25,985 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:26,001 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-28 10:04:26,185 WARN L477 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-28 10:04:26,186 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 35 times [2022-04-28 10:04:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783607470] [2022-04-28 10:04:26,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:26,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 36 times [2022-04-28 10:04:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:26,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284513836] [2022-04-28 10:04:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:26,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {8861#(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); {8849#true} is VALID [2022-04-28 10:04:26,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-28 10:04:26,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {8861#(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); {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= 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; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= 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; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= 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; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= 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; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,320 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:26,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {8859#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8860#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:26,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {8860#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8850#false} is VALID [2022-04-28 10:04:26,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-28 10:04:26,321 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-28 10:04:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:26,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284513836] [2022-04-28 10:04:26,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284513836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:26,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420391791] [2022-04-28 10:04:26,321 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:26,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:26,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:26,322 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-28 10:04:26,323 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-28 10:04:26,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:26,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:26,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:04:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:26,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:26,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#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); {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= 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; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= 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; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= 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; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= 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; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,625 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:26,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:26,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {8935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8850#false} is VALID [2022-04-28 10:04:26,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-28 10:04:26,628 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-28 10:04:26,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:26,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {8850#false} assume !false; {8850#false} is VALID [2022-04-28 10:04:26,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {8935#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8850#false} is VALID [2022-04-28 10:04:26,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:26,863 INFO L272 TraceCheckUtils]: 22: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:26,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {8857#(<= 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; {8858#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {8856#(<= 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; {8857#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {8855#(<= 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; {8856#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:26,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {8854#(<= 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; {8855#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:26,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {8849#true} assume !(~x~0 % 4294967296 > 0); {8854#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {8849#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; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {8849#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {8849#true} call #t~ret11 := main(); {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8849#true} {8849#true} #61#return; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {8849#true} assume true; {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {8849#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); {8849#true} is VALID [2022-04-28 10:04:26,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {8849#true} call ULTIMATE.init(); {8849#true} is VALID [2022-04-28 10:04:26,870 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-28 10:04:26,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420391791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:26,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:26,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-28 10:04:26,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:26,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783607470] [2022-04-28 10:04:26,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783607470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:26,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:26,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:04:26,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677691379] [2022-04-28 10:04:26,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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 26 [2022-04-28 10:04:26,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:26,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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-28 10:04:26,889 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-28 10:04:26,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:04:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:04:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:04:26,890 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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-28 10:04:27,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,602 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2022-04-28 10:04:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:04:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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 26 [2022-04-28 10:04:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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-28 10:04:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 10:04:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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-28 10:04:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 10:04:27,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 10:04:27,639 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-28 10:04:27,640 INFO L225 Difference]: With dead ends: 125 [2022-04-28 10:04:27,640 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 10:04:27,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:04:27,641 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:27,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 60 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 10:04:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2022-04-28 10:04:27,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:27,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:27,784 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:27,784 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,786 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-04-28 10:04:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-28 10:04:27,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:27,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:27,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 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-28 10:04:27,796 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 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-28 10:04:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:27,798 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-04-28 10:04:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-28 10:04:27,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:27,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:27,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:27,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-04-28 10:04:27,800 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 26 [2022-04-28 10:04:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:27,800 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-04-28 10:04:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 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-28 10:04:27,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 88 transitions. [2022-04-28 10:04:27,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 10:04:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:04:27,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:27,931 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:27,947 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-28 10:04:28,131 WARN L477 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-28 10:04:28,131 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 37 times [2022-04-28 10:04:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083589765] [2022-04-28 10:04:28,134 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:28,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 38 times [2022-04-28 10:04:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:28,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789967548] [2022-04-28 10:04:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:28,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {9665#(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); {9651#true} is VALID [2022-04-28 10:04:28,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-28 10:04:28,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-28 10:04:28,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:28,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {9665#(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); {9651#true} is VALID [2022-04-28 10:04:28,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-28 10:04:28,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-28 10:04:28,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-28 10:04:28,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9656#(= main_~y~0 0)} is VALID [2022-04-28 10:04:28,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {9656#(= 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; {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:28,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {9657#(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; {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:28,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {9658#(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; {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:28,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {9659#(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; {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:28,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {9660#(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; {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9662#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:28,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {9662#(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; {9663#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:28,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {9663#(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; {9664#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {9664#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-28 10:04:28,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-28 10:04:28,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-28 10:04:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789967548] [2022-04-28 10:04:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789967548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:28,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465321261] [2022-04-28 10:04:28,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:28,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:28,325 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-28 10:04:28,348 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-28 10:04:28,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:28,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:28,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:04:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:28,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:28,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9651#true} is VALID [2022-04-28 10:04:28,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#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); {9651#true} is VALID [2022-04-28 10:04:28,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-28 10:04:28,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-28 10:04:28,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-28 10:04:28,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9656#(= main_~y~0 0)} is VALID [2022-04-28 10:04:28,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {9656#(= 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; {9657#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:28,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {9657#(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; {9658#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:28,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {9658#(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; {9659#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:28,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {9659#(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; {9660#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:28,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {9660#(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; {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {9661#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9705#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {9705#(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; {9709#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:28,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {9709#(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; {9713#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {9713#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-28 10:04:28,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-28 10:04:28,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-28 10:04:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:28,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:28,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {9652#false} assume !false; {9652#false} is VALID [2022-04-28 10:04:28,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {9652#false} assume 0 == ~cond; {9652#false} is VALID [2022-04-28 10:04:28,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {9652#false} ~cond := #in~cond; {9652#false} is VALID [2022-04-28 10:04:28,752 INFO L272 TraceCheckUtils]: 22: Hoare triple {9652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9652#false} is VALID [2022-04-28 10:04:28,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {9652#false} assume !(~y~0 % 4294967296 > 0); {9652#false} is VALID [2022-04-28 10:04:28,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {9652#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {9768#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9652#false} is VALID [2022-04-28 10:04:28,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {9772#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9768#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:28,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {9776#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9772#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:28,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {9780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9776#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:28,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#(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; {9780#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:28,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(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; {9784#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {9651#true} ~z~0 := ~y~0; {9788#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {9651#true} assume !(~x~0 % 4294967296 > 0); {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {9651#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; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {9651#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; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {9651#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; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {9651#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; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {9651#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; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {9651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {9651#true} call #t~ret11 := main(); {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9651#true} {9651#true} #61#return; {9651#true} is VALID [2022-04-28 10:04:28,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {9651#true} assume true; {9651#true} is VALID [2022-04-28 10:04:28,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {9651#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); {9651#true} is VALID [2022-04-28 10:04:28,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {9651#true} call ULTIMATE.init(); {9651#true} is VALID [2022-04-28 10:04:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:04:28,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465321261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:28,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:28,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:04:28,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:28,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083589765] [2022-04-28 10:04:28,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083589765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:28,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:28,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441109460] [2022-04-28 10:04:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:28,763 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 26 [2022-04-28 10:04:28,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:28,763 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-28 10:04:28,782 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-28 10:04:28,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:28,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:28,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:04:28,783 INFO L87 Difference]: Start difference. First operand 69 states and 88 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-28 10:04:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,520 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 10:04:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:29,520 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 26 [2022-04-28 10:04:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:29,521 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-28 10:04:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:04:29,522 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-28 10:04:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:04:29,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-28 10:04:29,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:29,572 INFO L225 Difference]: With dead ends: 88 [2022-04-28 10:04:29,572 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:04:29,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:04:29,574 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:29,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:04:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-28 10:04:29,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:29,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:29,742 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:29,742 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,743 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 10:04:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 10:04:29,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:29,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:29,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:04:29,744 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:04:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:29,745 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 10:04:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 10:04:29,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:29,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:29,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:29,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-04-28 10:04:29,747 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 26 [2022-04-28 10:04:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:29,747 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-04-28 10:04:29,747 INFO L496 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-28 10:04:29,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2022-04-28 10:04:29,892 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-28 10:04:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-04-28 10:04:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:04:29,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:29,893 INFO L195 NwaCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:29,918 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-28 10:04:30,093 WARN L477 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-28 10:04:30,093 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1801953422, now seen corresponding path program 39 times [2022-04-28 10:04:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:30,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065393556] [2022-04-28 10:04:30,096 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:30,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1801953422, now seen corresponding path program 40 times [2022-04-28 10:04:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:30,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161237311] [2022-04-28 10:04:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {10339#(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); {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:30,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {10339#(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); {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-28 10:04:30,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-28 10:04:30,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10327#(= main_~y~0 0)} is VALID [2022-04-28 10:04:30,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {10327#(= 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; {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:30,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {10328#(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; {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:30,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {10329#(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; {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:30,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {10330#(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; {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:30,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {10331#(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; {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:30,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {10332#(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; {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:30,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {10333#(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; {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:30,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {10334#(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; {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:30,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {10335#(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; {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:30,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:30,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:04:30,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {10337#(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; {10338#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:30,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {10338#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-28 10:04:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161237311] [2022-04-28 10:04:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161237311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50786920] [2022-04-28 10:04:30,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:30,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:30,282 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-28 10:04:30,283 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-28 10:04:30,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:30,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:30,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:30,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:30,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10322#true} is VALID [2022-04-28 10:04:30,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#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); {10322#true} is VALID [2022-04-28 10:04:30,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-28 10:04:30,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-28 10:04:30,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-28 10:04:30,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10327#(= main_~y~0 0)} is VALID [2022-04-28 10:04:30,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {10327#(= 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; {10328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:30,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {10328#(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; {10329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:30,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {10329#(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; {10330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:30,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {10330#(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; {10331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:30,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {10331#(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; {10332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:30,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {10332#(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; {10333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:30,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {10333#(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; {10334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:30,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {10334#(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; {10335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:30,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {10335#(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; {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:30,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:30,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {10336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:04:30,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {10337#(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; {10394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {10394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-28 10:04:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:30,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {10323#false} assume !false; {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {10323#false} assume 0 == ~cond; {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {10323#false} ~cond := #in~cond; {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L272 TraceCheckUtils]: 22: Hoare triple {10323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {10323#false} assume !(~y~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {10323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10323#false} is VALID [2022-04-28 10:04:30,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {10440#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10323#false} is VALID [2022-04-28 10:04:30,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {10444#(< 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; {10440#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:30,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {10444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:30,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:30,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {10455#(< 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; {10448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:30,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {10459#(< 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; {10455#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:30,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {10463#(< 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; {10459#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:30,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {10467#(< 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; {10463#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:30,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {10471#(< 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; {10467#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:30,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {10475#(< 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; {10471#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:30,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {10479#(< 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; {10475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:30,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {10483#(< 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; {10479#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:30,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {10487#(< 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; {10483#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:30,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {10322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10487#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:30,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {10322#true} call #t~ret11 := main(); {10322#true} is VALID [2022-04-28 10:04:30,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10322#true} {10322#true} #61#return; {10322#true} is VALID [2022-04-28 10:04:30,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {10322#true} assume true; {10322#true} is VALID [2022-04-28 10:04:30,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {10322#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); {10322#true} is VALID [2022-04-28 10:04:30,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {10322#true} call ULTIMATE.init(); {10322#true} is VALID [2022-04-28 10:04:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:30,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50786920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:30,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:30,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:30,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065393556] [2022-04-28 10:04:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065393556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:30,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428764338] [2022-04-28 10:04:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:30,852 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 26 [2022-04-28 10:04:30,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:30,852 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-28 10:04:30,868 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-28 10:04:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:30,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:30,869 INFO L87 Difference]: Start difference. First operand 70 states and 89 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-28 10:04:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:32,148 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2022-04-28 10:04:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:04:32,148 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 26 [2022-04-28 10:04:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:32,148 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-28 10:04:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-28 10:04:32,149 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-28 10:04:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-28 10:04:32,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-28 10:04:32,213 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-28 10:04:32,214 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:04:32,214 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 10:04:32,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:04:32,215 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:32,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 88 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:04:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 10:04:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-04-28 10:04:32,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:32,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:32,370 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:32,370 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:32,372 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 10:04:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-28 10:04:32,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:32,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:32,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 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 101 states. [2022-04-28 10:04:32,373 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 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 101 states. [2022-04-28 10:04:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:32,374 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 10:04:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-28 10:04:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:32,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:32,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:32,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-28 10:04:32,376 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 26 [2022-04-28 10:04:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:32,376 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-28 10:04:32,376 INFO L496 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-28 10:04:32,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-28 10:04:32,508 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-28 10:04:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-28 10:04:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:04:32,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:32,508 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:32,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 10:04:32,709 WARN L477 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-28 10:04:32,709 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 41 times [2022-04-28 10:04:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957870391] [2022-04-28 10:04:32,712 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:32,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 42 times [2022-04-28 10:04:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:32,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867454541] [2022-04-28 10:04:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {11121#(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); {11106#true} is VALID [2022-04-28 10:04:32,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 10:04:32,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-28 10:04:32,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:32,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {11121#(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); {11106#true} is VALID [2022-04-28 10:04:32,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 10:04:32,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-28 10:04:32,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-28 10:04:32,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11111#(= main_~y~0 0)} is VALID [2022-04-28 10:04:32,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {11111#(= 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; {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:32,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {11112#(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; {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:32,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {11113#(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; {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:32,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {11114#(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; {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:32,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:32,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:32,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {11116#(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; {11117#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:32,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {11117#(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; {11118#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:32,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {11118#(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; {11119#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:32,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {11119#(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; {11120#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {11120#(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; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {11107#false} assume !(~z~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {11107#false} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-28 10:04:32,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-28 10:04:32,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-28 10:04:32,899 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-28 10:04:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867454541] [2022-04-28 10:04:32,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867454541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626816590] [2022-04-28 10:04:32,900 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:32,901 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-28 10:04:32,902 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-28 10:04:32,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:32,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:32,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:04:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:32,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:33,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11106#true} is VALID [2022-04-28 10:04:33,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#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); {11106#true} is VALID [2022-04-28 10:04:33,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 10:04:33,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-28 10:04:33,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-28 10:04:33,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11111#(= main_~y~0 0)} is VALID [2022-04-28 10:04:33,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {11111#(= 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; {11112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:33,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {11112#(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; {11113#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:33,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {11113#(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; {11114#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:33,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {11114#(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; {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {11115#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11158#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {11158#(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; {11162#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:33,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {11162#(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; {11166#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {11166#(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; {11170#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {11170#(and (= (+ (- 2) main_~y~0) (+ 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; {11174#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {11174#(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; {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {11107#false} assume !(~z~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11107#false} is VALID [2022-04-28 10:04:33,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {11107#false} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-28 10:04:33,221 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-28 10:04:33,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-28 10:04:33,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-28 10:04:33,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-28 10:04:33,221 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-28 10:04:33,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:33,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {11107#false} assume !false; {11107#false} is VALID [2022-04-28 10:04:33,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {11107#false} assume 0 == ~cond; {11107#false} is VALID [2022-04-28 10:04:33,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {11107#false} ~cond := #in~cond; {11107#false} is VALID [2022-04-28 10:04:33,487 INFO L272 TraceCheckUtils]: 23: Hoare triple {11107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11107#false} is VALID [2022-04-28 10:04:33,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {11220#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11107#false} is VALID [2022-04-28 10:04:33,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {11224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11220#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:33,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {11228#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11224#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:33,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {11232#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11228#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:33,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11232#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:04:33,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:33,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {11243#(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; {11236#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:33,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {11247#(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; {11243#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:33,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {11251#(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; {11247#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:33,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {11255#(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; {11251#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:33,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {11259#(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; {11255#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:33,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {11106#true} ~z~0 := ~y~0; {11259#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:33,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {11106#true} assume !(~x~0 % 4294967296 > 0); {11106#true} is VALID [2022-04-28 10:04:33,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {11106#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; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {11106#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; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {11106#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; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {11106#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; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {11106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {11106#true} call #t~ret11 := main(); {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11106#true} {11106#true} #61#return; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {11106#true} assume true; {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {11106#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); {11106#true} is VALID [2022-04-28 10:04:33,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {11106#true} call ULTIMATE.init(); {11106#true} is VALID [2022-04-28 10:04:33,495 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-28 10:04:33,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626816590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:33,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:33,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-28 10:04:33,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:33,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957870391] [2022-04-28 10:04:33,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957870391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:33,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:33,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672051876] [2022-04-28 10:04:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:33,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:33,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:33,511 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-28 10:04:33,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:33,512 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,110 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-28 10:04:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-28 10:04:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-28 10:04:34,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2022-04-28 10:04:34,137 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-28 10:04:34,138 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:04:34,138 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 10:04:34,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:04:34,139 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:34,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 10:04:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 10:04:34,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:34,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:34,271 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:34,271 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,272 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 10:04:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 10:04:34,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:34,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:34,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 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 69 states. [2022-04-28 10:04:34,273 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 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 69 states. [2022-04-28 10:04:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:34,274 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 10:04:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 10:04:34,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:34,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:34,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:34,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-04-28 10:04:34,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 27 [2022-04-28 10:04:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:34,276 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-04-28 10:04:34,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 10:04:34,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 88 transitions. [2022-04-28 10:04:34,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 10:04:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:04:34,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:34,408 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:34,424 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-28 10:04:34,609 WARN L477 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-28 10:04:34,609 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 43 times [2022-04-28 10:04:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:34,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002328573] [2022-04-28 10:04:34,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:34,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 44 times [2022-04-28 10:04:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:34,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795898956] [2022-04-28 10:04:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {11781#(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); {11766#true} is VALID [2022-04-28 10:04:34,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-28 10:04:34,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-28 10:04:34,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11781#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:34,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {11781#(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); {11766#true} is VALID [2022-04-28 10:04:34,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-28 10:04:34,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-28 10:04:34,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-28 10:04:34,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11771#(= main_~y~0 0)} is VALID [2022-04-28 10:04:34,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {11771#(= 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; {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:34,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#(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; {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:34,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {11773#(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; {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:34,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {11774#(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; {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:34,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {11775#(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; {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11777#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:34,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {11777#(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; {11778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:34,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {11778#(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; {11779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {11779#(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; {11780#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-28 10:04:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:34,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795898956] [2022-04-28 10:04:34,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795898956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:34,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709970318] [2022-04-28 10:04:34,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:34,765 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-28 10:04:34,765 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-28 10:04:34,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:34,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:34,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:04:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:34,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:34,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11766#true} is VALID [2022-04-28 10:04:34,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#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); {11766#true} is VALID [2022-04-28 10:04:34,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-28 10:04:34,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-28 10:04:34,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-28 10:04:34,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11771#(= main_~y~0 0)} is VALID [2022-04-28 10:04:34,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {11771#(= 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; {11772#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:34,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#(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; {11773#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:34,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {11773#(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; {11774#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:34,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {11774#(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; {11775#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:34,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {11775#(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; {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {11776#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11821#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {11821#(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; {11825#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:34,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {11825#(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; {11829#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {11829#(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; {11833#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {11833#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-28 10:04:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:34,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:35,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {11767#false} assume !false; {11767#false} is VALID [2022-04-28 10:04:35,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {11767#false} assume 0 == ~cond; {11767#false} is VALID [2022-04-28 10:04:35,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {11767#false} ~cond := #in~cond; {11767#false} is VALID [2022-04-28 10:04:35,204 INFO L272 TraceCheckUtils]: 23: Hoare triple {11767#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11767#false} is VALID [2022-04-28 10:04:35,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {11767#false} assume !(~y~0 % 4294967296 > 0); {11767#false} is VALID [2022-04-28 10:04:35,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {11767#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:35,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {11885#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11767#false} is VALID [2022-04-28 10:04:35,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {11889#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11885#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:35,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {11893#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11889#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:35,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {11897#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11893#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:35,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {11901#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11897#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:35,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {11905#(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; {11901#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:35,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {11909#(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; {11905#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:35,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {11913#(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; {11909#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:35,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {11766#true} ~z~0 := ~y~0; {11913#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:35,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {11766#true} assume !(~x~0 % 4294967296 > 0); {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {11766#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; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {11766#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; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {11766#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; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {11766#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; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {11766#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; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {11766#true} call #t~ret11 := main(); {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11766#true} {11766#true} #61#return; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {11766#true} assume true; {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {11766#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); {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {11766#true} call ULTIMATE.init(); {11766#true} is VALID [2022-04-28 10:04:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:04:35,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709970318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:35,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:35,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-28 10:04:35,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:35,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002328573] [2022-04-28 10:04:35,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002328573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:35,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:35,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140906586] [2022-04-28 10:04:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:35,212 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 27 [2022-04-28 10:04:35,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:35,212 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-28 10:04:35,229 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-28 10:04:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:04:35,230 INFO L87 Difference]: Start difference. First operand 69 states and 88 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-28 10:04:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:35,829 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-28 10:04:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:35,829 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 27 [2022-04-28 10:04:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:35,829 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-28 10:04:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:04:35,830 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-28 10:04:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:04:35,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-28 10:04:35,865 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-28 10:04:35,866 INFO L225 Difference]: With dead ends: 88 [2022-04-28 10:04:35,866 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:04:35,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:04:35,867 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:35,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:04:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-28 10:04:36,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:36,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:36,017 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:36,017 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:36,018 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 10:04:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 10:04:36,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:36,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:36,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:04:36,019 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 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 77 states. [2022-04-28 10:04:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:36,020 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 10:04:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 10:04:36,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:36,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:36,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:36,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-04-28 10:04:36,022 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 27 [2022-04-28 10:04:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:36,022 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-04-28 10:04:36,022 INFO L496 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-28 10:04:36,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2022-04-28 10:04:36,152 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-28 10:04:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-04-28 10:04:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:04:36,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:36,153 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:36,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 10:04:36,363 WARN L477 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-28 10:04:36,363 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -517569937, now seen corresponding path program 45 times [2022-04-28 10:04:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:36,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480501420] [2022-04-28 10:04:36,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:36,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -517569937, now seen corresponding path program 46 times [2022-04-28 10:04:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:36,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128777106] [2022-04-28 10:04:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:36,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {12463#(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); {12445#true} is VALID [2022-04-28 10:04:36,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-28 10:04:36,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-28 10:04:36,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:36,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {12463#(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); {12445#true} is VALID [2022-04-28 10:04:36,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-28 10:04:36,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-28 10:04:36,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-28 10:04:36,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12450#(= main_~y~0 0)} is VALID [2022-04-28 10:04:36,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {12450#(= 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; {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:36,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#(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; {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:36,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {12452#(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; {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:36,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {12453#(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; {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:36,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {12454#(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; {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:36,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {12455#(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; {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:36,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {12456#(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; {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:36,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#(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; {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:36,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {12458#(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; {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:36,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {12459#(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; {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:36,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:36,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:04:36,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#(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; {12462#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:36,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {12462#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:36,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:36,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:36,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:36,608 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-28 10:04:36,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-28 10:04:36,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-28 10:04:36,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-28 10:04:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128777106] [2022-04-28 10:04:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128777106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972641708] [2022-04-28 10:04:36,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:36,612 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-28 10:04:36,636 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-28 10:04:36,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:36,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:36,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:36,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:36,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12445#true} is VALID [2022-04-28 10:04:36,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#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); {12445#true} is VALID [2022-04-28 10:04:36,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-28 10:04:36,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-28 10:04:36,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-28 10:04:36,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12450#(= main_~y~0 0)} is VALID [2022-04-28 10:04:36,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {12450#(= 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; {12451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:36,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#(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; {12452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:36,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {12452#(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; {12453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:36,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {12453#(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; {12454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:36,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {12454#(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; {12455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:36,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {12455#(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; {12456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:36,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {12456#(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; {12457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:36,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {12457#(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; {12458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:36,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {12458#(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; {12459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:36,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {12459#(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; {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:36,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:36,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {12460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {12461#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:04:36,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {12461#(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; {12521#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {12521#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-28 10:04:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:36,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {12446#false} assume !false; {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {12446#false} assume 0 == ~cond; {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {12446#false} ~cond := #in~cond; {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L272 TraceCheckUtils]: 23: Hoare triple {12446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {12446#false} assume !(~y~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {12446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12446#false} is VALID [2022-04-28 10:04:37,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {12567#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12446#false} is VALID [2022-04-28 10:04:37,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {12571#(< 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; {12567#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:37,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {12571#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:37,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:37,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {12582#(< 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; {12575#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:37,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {12586#(< 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; {12582#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:37,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {12590#(< 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; {12586#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:37,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {12594#(< 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; {12590#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:37,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {12598#(< 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; {12594#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:37,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {12602#(< 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; {12598#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:37,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {12606#(< 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; {12602#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:37,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#(< 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; {12606#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:37,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#(< 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; {12610#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:37,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {12618#(< 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; {12614#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:37,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {12445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12618#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:37,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {12445#true} call #t~ret11 := main(); {12445#true} is VALID [2022-04-28 10:04:37,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12445#true} {12445#true} #61#return; {12445#true} is VALID [2022-04-28 10:04:37,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {12445#true} assume true; {12445#true} is VALID [2022-04-28 10:04:37,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {12445#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); {12445#true} is VALID [2022-04-28 10:04:37,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {12445#true} call ULTIMATE.init(); {12445#true} is VALID [2022-04-28 10:04:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972641708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:37,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:37,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480501420] [2022-04-28 10:04:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480501420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:37,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:37,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013900358] [2022-04-28 10:04:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:37,251 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 27 [2022-04-28 10:04:37,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:37,251 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-28 10:04:37,268 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-28 10:04:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:37,269 INFO L87 Difference]: Start difference. First operand 70 states and 89 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-28 10:04:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,571 INFO L93 Difference]: Finished difference Result 110 states and 151 transitions. [2022-04-28 10:04:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:38,571 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 27 [2022-04-28 10:04:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:38,575 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-28 10:04:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-28 10:04:38,578 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-28 10:04:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-28 10:04:38,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-28 10:04:38,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:38,644 INFO L225 Difference]: With dead ends: 110 [2022-04-28 10:04:38,644 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 10:04:38,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:04:38,645 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:38,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 93 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:04:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 10:04:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2022-04-28 10:04:38,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:38,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:38,808 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:38,808 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,810 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 10:04:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 10:04:38,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:38,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:38,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 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 102 states. [2022-04-28 10:04:38,810 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 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 102 states. [2022-04-28 10:04:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,812 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2022-04-28 10:04:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2022-04-28 10:04:38,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:38,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:38,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:38,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-28 10:04:38,814 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 27 [2022-04-28 10:04:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:38,814 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-28 10:04:38,814 INFO L496 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-28 10:04:38,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 97 transitions. [2022-04-28 10:04:38,982 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-28 10:04:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-28 10:04:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:04:38,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:38,982 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:39,009 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-28 10:04:39,183 WARN L477 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-28 10:04:39,183 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 47 times [2022-04-28 10:04:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977546456] [2022-04-28 10:04:39,187 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:39,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 48 times [2022-04-28 10:04:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352029128] [2022-04-28 10:04:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:39,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {13259#(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); {13243#true} is VALID [2022-04-28 10:04:39,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-28 10:04:39,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-28 10:04:39,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:39,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {13259#(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); {13243#true} is VALID [2022-04-28 10:04:39,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-28 10:04:39,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-28 10:04:39,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-28 10:04:39,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13248#(= main_~y~0 0)} is VALID [2022-04-28 10:04:39,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {13248#(= 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; {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:39,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {13249#(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; {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:39,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {13250#(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; {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:39,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {13251#(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; {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:39,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {13252#(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; {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {13254#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:39,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {13254#(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; {13255#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:39,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {13255#(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; {13256#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:39,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {13256#(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; {13257#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:39,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {13257#(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; {13258#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {13258#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-28 10:04:39,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-28 10:04:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:39,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352029128] [2022-04-28 10:04:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352029128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:39,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991310649] [2022-04-28 10:04:39,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:39,400 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-28 10:04:39,401 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-28 10:04:39,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:39,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:39,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:04:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:39,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:39,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13243#true} is VALID [2022-04-28 10:04:39,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#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); {13243#true} is VALID [2022-04-28 10:04:39,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-28 10:04:39,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-28 10:04:39,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-28 10:04:39,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13248#(= main_~y~0 0)} is VALID [2022-04-28 10:04:39,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {13248#(= 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; {13249#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:39,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {13249#(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; {13250#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:39,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {13250#(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; {13251#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:39,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {13251#(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; {13252#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:39,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {13252#(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; {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {13253#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {13299#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {13299#(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; {13303#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:39,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {13303#(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; {13307#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {13307#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) 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; {13311#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {13311#(and (= (+ main_~z~0 2) (+ (- 1) 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; {13315#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {13315#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {13244#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-28 10:04:39,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-28 10:04:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:39,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:39,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {13244#false} assume !false; {13244#false} is VALID [2022-04-28 10:04:39,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {13244#false} assume 0 == ~cond; {13244#false} is VALID [2022-04-28 10:04:39,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {13244#false} ~cond := #in~cond; {13244#false} is VALID [2022-04-28 10:04:39,947 INFO L272 TraceCheckUtils]: 24: Hoare triple {13244#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13244#false} is VALID [2022-04-28 10:04:39,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {13244#false} assume !(~y~0 % 4294967296 > 0); {13244#false} is VALID [2022-04-28 10:04:39,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {13364#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13244#false} is VALID [2022-04-28 10:04:39,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {13368#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13364#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:39,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {13372#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13368#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:39,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {13376#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13372#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:39,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {13380#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13376#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:39,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {13384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {13380#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:39,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {13388#(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; {13384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:39,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {13392#(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; {13388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:39,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {13396#(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; {13392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {13400#(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; {13396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {13243#true} ~z~0 := ~y~0; {13400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {13243#true} assume !(~x~0 % 4294967296 > 0); {13243#true} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {13243#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; {13243#true} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {13243#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; {13243#true} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {13243#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; {13243#true} is VALID [2022-04-28 10:04:39,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {13243#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; {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {13243#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; {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {13243#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {13243#true} call #t~ret11 := main(); {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13243#true} {13243#true} #61#return; {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {13243#true} assume true; {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {13243#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); {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {13243#true} call ULTIMATE.init(); {13243#true} is VALID [2022-04-28 10:04:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:39,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991310649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:39,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:39,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29 [2022-04-28 10:04:39,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977546456] [2022-04-28 10:04:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977546456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268759849] [2022-04-28 10:04:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:39,956 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 28 [2022-04-28 10:04:39,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:39,956 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-28 10:04:39,972 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-28 10:04:39,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:04:39,973 INFO L87 Difference]: Start difference. First operand 76 states and 97 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-28 10:04:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:40,716 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2022-04-28 10:04:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:40,716 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 28 [2022-04-28 10:04:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:40,716 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-28 10:04:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 10:04:40,717 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-28 10:04:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 10:04:40,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2022-04-28 10:04:40,759 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-28 10:04:40,760 INFO L225 Difference]: With dead ends: 95 [2022-04-28 10:04:40,760 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 10:04:40,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:04:40,761 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:40,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 10:04:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-04-28 10:04:40,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:40,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:40,914 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:40,915 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:40,915 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-28 10:04:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-28 10:04:40,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:40,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:40,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 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 84 states. [2022-04-28 10:04:40,916 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 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 84 states. [2022-04-28 10:04:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:40,917 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-28 10:04:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-28 10:04:40,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:40,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:40,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:40,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-28 10:04:40,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 28 [2022-04-28 10:04:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:40,919 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-28 10:04:40,919 INFO L496 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-28 10:04:40,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 98 transitions. [2022-04-28 10:04:41,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-28 10:04:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:04:41,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:41,069 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:41,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 10:04:41,269 WARN L477 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-28 10:04:41,269 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 49 times [2022-04-28 10:04:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:41,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740151106] [2022-04-28 10:04:41,277 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:41,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 50 times [2022-04-28 10:04:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:41,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489192995] [2022-04-28 10:04:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:41,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {13991#(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); {13976#true} is VALID [2022-04-28 10:04:41,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-28 10:04:41,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-28 10:04:41,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:41,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {13991#(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); {13976#true} is VALID [2022-04-28 10:04:41,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-28 10:04:41,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-28 10:04:41,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-28 10:04:41,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13981#(= main_~y~0 0)} is VALID [2022-04-28 10:04:41,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {13981#(= 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; {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:41,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {13982#(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; {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:41,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {13983#(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; {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:41,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {13984#(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; {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:41,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {13985#(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; {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:41,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {13986#(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; {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:41,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:41,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:41,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {13988#(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; {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:41,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {13989#(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; {13990#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {13990#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,432 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-28 10:04:41,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-28 10:04:41,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-28 10:04:41,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-28 10:04:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489192995] [2022-04-28 10:04:41,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489192995] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747562693] [2022-04-28 10:04:41,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:41,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:41,436 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-28 10:04:41,443 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-28 10:04:41,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:41,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:41,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:04:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:41,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:41,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13976#true} is VALID [2022-04-28 10:04:41,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#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); {13976#true} is VALID [2022-04-28 10:04:41,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-28 10:04:41,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-28 10:04:41,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-28 10:04:41,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13981#(= main_~y~0 0)} is VALID [2022-04-28 10:04:41,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {13981#(= 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; {13982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:41,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {13982#(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; {13983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:41,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {13983#(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; {13984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:41,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {13984#(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; {13985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:41,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {13985#(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; {13986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:41,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {13986#(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; {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:41,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:41,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {13987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13988#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:41,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {13988#(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; {13989#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {13989#(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; {14040#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {14040#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,712 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-28 10:04:41,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-28 10:04:41,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-28 10:04:41,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-28 10:04:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:41,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:41,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#false} assume !false; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#false} assume 0 == ~cond; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#false} ~cond := #in~cond; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L272 TraceCheckUtils]: 24: Hoare triple {13977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#false} assume !(~y~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13977#false} is VALID [2022-04-28 10:04:41,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {14110#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13977#false} is VALID [2022-04-28 10:04:41,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {14114#(< 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; {14110#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:41,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {14118#(< 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; {14114#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:41,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {14118#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:41,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:41,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {14129#(< 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; {14122#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:41,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {14133#(< 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; {14129#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:41,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {14137#(< 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; {14133#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:41,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {14141#(< 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; {14137#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:41,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {14145#(< 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; {14141#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:41,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {14149#(< 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; {14145#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:41,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {13976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14149#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:41,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {13976#true} call #t~ret11 := main(); {13976#true} is VALID [2022-04-28 10:04:41,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13976#true} {13976#true} #61#return; {13976#true} is VALID [2022-04-28 10:04:41,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {13976#true} assume true; {13976#true} is VALID [2022-04-28 10:04:41,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {13976#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); {13976#true} is VALID [2022-04-28 10:04:41,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {13976#true} call ULTIMATE.init(); {13976#true} is VALID [2022-04-28 10:04:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:41,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747562693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:41,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:41,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:04:41,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:41,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740151106] [2022-04-28 10:04:41,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740151106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:41,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:41,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:41,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614302015] [2022-04-28 10:04:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:41,944 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 28 [2022-04-28 10:04:41,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:41,944 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-28 10:04:41,960 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-28 10:04:41,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:04:41,961 INFO L87 Difference]: Start difference. First operand 77 states and 98 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-28 10:04:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:42,789 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-28 10:04:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:42,789 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 28 [2022-04-28 10:04:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:42,789 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-28 10:04:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:04:42,790 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-28 10:04:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:04:42,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-28 10:04:42,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:42,859 INFO L225 Difference]: With dead ends: 98 [2022-04-28 10:04:42,859 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 10:04:42,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:04:42,861 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:42,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 10:04:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-04-28 10:04:43,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:43,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:43,082 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:43,083 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:43,084 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-28 10:04:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-28 10:04:43,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:43,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 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 86 states. [2022-04-28 10:04:43,084 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 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 86 states. [2022-04-28 10:04:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:43,086 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-04-28 10:04:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2022-04-28 10:04:43,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:43,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:43,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:43,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-04-28 10:04:43,087 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 28 [2022-04-28 10:04:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:43,087 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-04-28 10:04:43,087 INFO L496 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-28 10:04:43,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 99 transitions. [2022-04-28 10:04:43,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-04-28 10:04:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:04:43,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:43,245 INFO L195 NwaCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:43,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 10:04:43,447 WARN L477 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-28 10:04:43,447 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 591649966, now seen corresponding path program 51 times [2022-04-28 10:04:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57128752] [2022-04-28 10:04:43,450 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:43,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 591649966, now seen corresponding path program 52 times [2022-04-28 10:04:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128181863] [2022-04-28 10:04:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {14737#(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); {14718#true} is VALID [2022-04-28 10:04:43,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-28 10:04:43,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-28 10:04:43,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:43,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {14737#(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); {14718#true} is VALID [2022-04-28 10:04:43,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-28 10:04:43,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-28 10:04:43,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-28 10:04:43,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14723#(= main_~y~0 0)} is VALID [2022-04-28 10:04:43,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {14723#(= 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; {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:43,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {14724#(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; {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:43,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {14725#(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; {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:43,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {14726#(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; {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:43,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {14727#(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; {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:43,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {14728#(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; {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:43,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {14729#(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; {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:43,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {14730#(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; {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:43,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {14731#(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; {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:43,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {14732#(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; {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:43,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {14733#(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; {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:43,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:43,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:43,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(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; {14736#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {14736#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-28 10:04:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:43,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128181863] [2022-04-28 10:04:43,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128181863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:43,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56169821] [2022-04-28 10:04:43,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:43,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:43,694 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-28 10:04:43,695 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-28 10:04:43,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:43,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:43,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:04:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:43,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:43,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14718#true} is VALID [2022-04-28 10:04:43,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#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); {14718#true} is VALID [2022-04-28 10:04:43,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-28 10:04:43,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-28 10:04:43,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-28 10:04:43,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14723#(= main_~y~0 0)} is VALID [2022-04-28 10:04:43,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {14723#(= 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; {14724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:43,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {14724#(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; {14725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:43,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {14725#(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; {14726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:43,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {14726#(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; {14727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:43,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {14727#(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; {14728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:43,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {14728#(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; {14729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:43,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {14729#(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; {14730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:43,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {14730#(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; {14731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:43,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {14731#(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; {14732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:43,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {14732#(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; {14733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:43,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {14733#(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; {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:43,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:43,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {14735#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:43,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(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; {14798#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:04:43,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {14798#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-28 10:04:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:44,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:44,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {14719#false} assume !false; {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {14719#false} assume 0 == ~cond; {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {14719#false} ~cond := #in~cond; {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L272 TraceCheckUtils]: 24: Hoare triple {14719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {14719#false} assume !(~y~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:44,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14719#false} is VALID [2022-04-28 10:04:44,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {14844#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14719#false} is VALID [2022-04-28 10:04:44,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {14848#(< 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; {14844#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:44,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {14848#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:44,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:44,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {14859#(< 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; {14852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:44,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {14863#(< 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; {14859#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:44,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {14867#(< 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; {14863#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:44,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {14871#(< 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; {14867#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:44,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {14875#(< 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; {14871#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:44,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {14879#(< 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; {14875#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:44,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {14883#(< 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; {14879#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:44,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {14887#(< 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; {14883#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:44,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {14891#(< 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; {14887#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:44,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {14895#(< 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; {14891#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:44,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {14899#(< 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; {14895#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:44,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {14718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14899#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:04:44,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {14718#true} call #t~ret11 := main(); {14718#true} is VALID [2022-04-28 10:04:44,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14718#true} {14718#true} #61#return; {14718#true} is VALID [2022-04-28 10:04:44,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {14718#true} assume true; {14718#true} is VALID [2022-04-28 10:04:44,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {14718#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); {14718#true} is VALID [2022-04-28 10:04:44,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {14718#true} call ULTIMATE.init(); {14718#true} is VALID [2022-04-28 10:04:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:44,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56169821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:44,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:44,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:04:44,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:44,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57128752] [2022-04-28 10:04:44,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57128752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:44,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:44,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:04:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37147521] [2022-04-28 10:04:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:44,370 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 28 [2022-04-28 10:04:44,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:44,370 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-28 10:04:44,387 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-28 10:04:44,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:04:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:04:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:04:44,388 INFO L87 Difference]: Start difference. First operand 78 states and 99 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-28 10:04:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,960 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2022-04-28 10:04:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:04:45,961 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 28 [2022-04-28 10:04:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:45,961 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-28 10:04:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-28 10:04:45,962 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-28 10:04:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-28 10:04:45,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 91 transitions. [2022-04-28 10:04:46,035 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-28 10:04:46,036 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:04:46,036 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 10:04:46,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:04:46,037 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 67 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:46,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 101 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:04:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 10:04:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 84. [2022-04-28 10:04:46,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:46,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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-28 10:04:46,222 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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-28 10:04:46,223 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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-28 10:04:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:46,224 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 10:04:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 10:04:46,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:46,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:46,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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 111 states. [2022-04-28 10:04:46,225 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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 111 states. [2022-04-28 10:04:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:46,226 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 10:04:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 10:04:46,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:46,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:46,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:46,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 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-28 10:04:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-28 10:04:46,228 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 28 [2022-04-28 10:04:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:46,228 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-28 10:04:46,228 INFO L496 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-28 10:04:46,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-28 10:04:46,384 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-28 10:04:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-28 10:04:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:04:46,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:46,385 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:46,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 10:04:46,587 WARN L477 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-28 10:04:46,587 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 53 times [2022-04-28 10:04:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:46,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760760129] [2022-04-28 10:04:46,590 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:46,590 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 54 times [2022-04-28 10:04:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:46,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73095342] [2022-04-28 10:04:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {15591#(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); {15578#true} is VALID [2022-04-28 10:04:46,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-28 10:04:46,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {15591#(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); {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:46,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:46,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:46,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:46,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= 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; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:46,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= 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; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= 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; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= 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; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= 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; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:46,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:46,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:46,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:46,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:46,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:46,762 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15589#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:46,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {15589#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15590#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:46,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {15590#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15579#false} is VALID [2022-04-28 10:04:46,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-28 10:04:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73095342] [2022-04-28 10:04:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73095342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649212072] [2022-04-28 10:04:46,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:46,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:46,772 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-28 10:04:46,783 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-28 10:04:46,816 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:46,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:46,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:04:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:47,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#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); {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= 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; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:47,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= 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; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= 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; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= 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; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= 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; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:47,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:47,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:47,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,053 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:47,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:47,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {15674#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15579#false} is VALID [2022-04-28 10:04:47,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-28 10:04:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:47,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:47,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {15579#false} assume !false; {15579#false} is VALID [2022-04-28 10:04:47,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {15674#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15579#false} is VALID [2022-04-28 10:04:47,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:47,297 INFO L272 TraceCheckUtils]: 25: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:47,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:47,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:47,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {15587#(<= 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; {15588#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:04:47,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {15586#(<= 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; {15587#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {15585#(<= 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; {15586#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {15584#(<= 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; {15585#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:04:47,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {15583#(<= 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; {15584#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:04:47,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {15578#true} assume !(~x~0 % 4294967296 > 0); {15583#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {15578#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; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {15578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {15578#true} call #t~ret11 := main(); {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15578#true} {15578#true} #61#return; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {15578#true} assume true; {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {15578#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); {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {15578#true} call ULTIMATE.init(); {15578#true} is VALID [2022-04-28 10:04:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649212072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:47,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:47,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-28 10:04:47,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:47,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760760129] [2022-04-28 10:04:47,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760760129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:47,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:47,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447022283] [2022-04-28 10:04:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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 29 [2022-04-28 10:04:47,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:47,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-28 10:04:47,327 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-28 10:04:47,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:04:47,328 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-28 10:04:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:48,366 INFO L93 Difference]: Finished difference Result 179 states and 231 transitions. [2022-04-28 10:04:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:48,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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 29 [2022-04-28 10:04:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-28 10:04:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-28 10:04:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-28 10:04:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-28 10:04:48,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2022-04-28 10:04:48,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:48,433 INFO L225 Difference]: With dead ends: 179 [2022-04-28 10:04:48,433 INFO L226 Difference]: Without dead ends: 168 [2022-04-28 10:04:48,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:04:48,434 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:48,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 68 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-28 10:04:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 88. [2022-04-28 10:04:48,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:48,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:48,625 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:48,625 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:48,627 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-28 10:04:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-28 10:04:48,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:48,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:48,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 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 168 states. [2022-04-28 10:04:48,628 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 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 168 states. [2022-04-28 10:04:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:48,630 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2022-04-28 10:04:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 219 transitions. [2022-04-28 10:04:48,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:48,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:48,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:48,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-04-28 10:04:48,632 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 29 [2022-04-28 10:04:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:48,632 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-04-28 10:04:48,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 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-28 10:04:48,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 113 transitions. [2022-04-28 10:04:48,837 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-28 10:04:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-04-28 10:04:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:04:48,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:48,838 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:48,864 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-28 10:04:49,038 WARN L477 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-28 10:04:49,039 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 55 times [2022-04-28 10:04:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:49,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063493042] [2022-04-28 10:04:49,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:49,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 56 times [2022-04-28 10:04:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:49,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874963698] [2022-04-28 10:04:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:49,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:49,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {16669#(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); {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:49,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {16669#(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); {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-28 10:04:49,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-28 10:04:49,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16658#(= main_~y~0 0)} is VALID [2022-04-28 10:04:49,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {16658#(= 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; {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:49,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {16659#(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; {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:49,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {16660#(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; {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:49,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {16661#(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; {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:49,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {16662#(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; {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:49,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {16663#(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; {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {16665#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:49,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {16665#(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; {16666#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:49,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {16666#(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; {16667#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:49,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {16667#(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; {16668#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {16668#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-28 10:04:49,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-28 10:04:49,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-28 10:04:49,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-28 10:04:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:49,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874963698] [2022-04-28 10:04:49,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874963698] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:49,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079418176] [2022-04-28 10:04:49,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:49,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:49,239 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-28 10:04:49,262 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-28 10:04:49,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:49,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:49,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:04:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:49,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:49,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16653#true} is VALID [2022-04-28 10:04:49,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#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); {16653#true} is VALID [2022-04-28 10:04:49,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-28 10:04:49,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-28 10:04:49,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-28 10:04:49,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16658#(= main_~y~0 0)} is VALID [2022-04-28 10:04:49,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {16658#(= 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; {16659#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:49,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {16659#(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; {16660#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:49,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {16660#(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; {16661#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:49,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {16661#(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; {16662#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:49,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {16662#(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; {16663#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:49,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {16663#(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; {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {16664#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {16712#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {16712#(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; {16716#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:49,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {16716#(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; {16720#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {16720#(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; {16724#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {16724#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-28 10:04:49,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-28 10:04:49,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-28 10:04:49,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-28 10:04:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:49,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {16654#false} assume 0 == ~cond; {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {16654#false} ~cond := #in~cond; {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L272 TraceCheckUtils]: 25: Hoare triple {16654#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {16654#false} assume !(~y~0 % 4294967296 > 0); {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {16654#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {16782#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16654#false} is VALID [2022-04-28 10:04:49,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {16786#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16782#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:49,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {16790#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16786#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:49,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {16794#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16790#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:49,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {16798#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16794#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:49,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {16802#(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; {16798#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:49,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {16806#(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; {16802#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {16810#(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; {16806#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {16653#true} ~z~0 := ~y~0; {16810#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {16653#true} assume !(~x~0 % 4294967296 > 0); {16653#true} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {16653#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; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {16653#true} call #t~ret11 := main(); {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16653#true} #61#return; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#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); {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {16653#true} call ULTIMATE.init(); {16653#true} is VALID [2022-04-28 10:04:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:04:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079418176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:49,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:49,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-28 10:04:49,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:49,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063493042] [2022-04-28 10:04:49,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063493042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:49,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311248788] [2022-04-28 10:04:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:49,723 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 29 [2022-04-28 10:04:49,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:49,723 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-28 10:04:49,738 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-28 10:04:49,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:49,739 INFO L87 Difference]: Start difference. First operand 88 states and 113 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-28 10:04:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:50,649 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-28 10:04:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:50,649 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 29 [2022-04-28 10:04:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:50,649 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-28 10:04:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 10:04:50,650 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-28 10:04:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 10:04:50,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-28 10:04:50,691 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-28 10:04:50,692 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:04:50,692 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:04:50,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:04:50,693 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:50,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:04:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-04-28 10:04:50,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:50,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:50,885 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:50,885 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:50,886 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-28 10:04:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-28 10:04:50,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:50,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:50,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 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 97 states. [2022-04-28 10:04:50,887 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 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 97 states. [2022-04-28 10:04:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:50,888 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-28 10:04:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-28 10:04:50,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:50,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:50,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:50,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-04-28 10:04:50,890 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 29 [2022-04-28 10:04:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:50,890 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-04-28 10:04:50,890 INFO L496 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-28 10:04:50,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 114 transitions. [2022-04-28 10:04:51,051 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-28 10:04:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-04-28 10:04:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:04:51,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:51,052 INFO L195 NwaCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:51,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 10:04:51,252 WARN L477 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-28 10:04:51,253 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 617728591, now seen corresponding path program 57 times [2022-04-28 10:04:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781034312] [2022-04-28 10:04:51,255 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:51,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 617728591, now seen corresponding path program 58 times [2022-04-28 10:04:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:51,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625118824] [2022-04-28 10:04:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {17493#(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); {17473#true} is VALID [2022-04-28 10:04:51,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-28 10:04:51,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-28 10:04:51,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:51,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {17493#(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); {17473#true} is VALID [2022-04-28 10:04:51,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-28 10:04:51,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-28 10:04:51,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-28 10:04:51,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17478#(= main_~y~0 0)} is VALID [2022-04-28 10:04:51,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {17478#(= 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; {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:51,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {17479#(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; {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:51,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {17480#(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; {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:51,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {17481#(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; {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:51,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {17482#(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; {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:51,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {17483#(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; {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:51,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {17484#(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; {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:51,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {17485#(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; {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:51,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {17486#(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; {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:51,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {17487#(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; {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:51,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(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; {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:51,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {17489#(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; {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:04:51,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:04:51,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:04:51,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {17491#(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; {17492#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-28 10:04:51,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-28 10:04:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:51,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625118824] [2022-04-28 10:04:51,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625118824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:51,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307193352] [2022-04-28 10:04:51,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:51,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:51,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:51,564 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-28 10:04:51,566 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-28 10:04:51,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:51,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:51,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:04:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:51,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17473#true} is VALID [2022-04-28 10:04:51,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#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); {17473#true} is VALID [2022-04-28 10:04:51,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-28 10:04:51,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-28 10:04:51,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-28 10:04:51,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17478#(= main_~y~0 0)} is VALID [2022-04-28 10:04:51,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {17478#(= 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; {17479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:51,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {17479#(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; {17480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:51,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {17480#(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; {17481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:51,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {17481#(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; {17482#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:51,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {17482#(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; {17483#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:51,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {17483#(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; {17484#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:51,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {17484#(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; {17485#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:51,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {17485#(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; {17486#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:51,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {17486#(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; {17487#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:51,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {17487#(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; {17488#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:51,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {17488#(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; {17489#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:51,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {17489#(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; {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:04:51,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:04:51,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {17490#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {17491#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:04:51,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {17491#(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; {17557#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:51,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {17557#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:51,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:51,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:51,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:51,883 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-28 10:04:51,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-28 10:04:51,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-28 10:04:51,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-28 10:04:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:51,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {17474#false} assume !false; {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {17474#false} assume 0 == ~cond; {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {17474#false} ~cond := #in~cond; {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L272 TraceCheckUtils]: 25: Hoare triple {17474#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {17474#false} assume !(~y~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:52,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {17474#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17474#false} is VALID [2022-04-28 10:04:52,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {17603#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17474#false} is VALID [2022-04-28 10:04:52,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {17607#(< 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; {17603#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:52,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {17607#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {17618#(< 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; {17611#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {17622#(< 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; {17618#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:52,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {17626#(< 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; {17622#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:52,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {17630#(< 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; {17626#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:52,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {17634#(< 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; {17630#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:52,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {17638#(< 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; {17634#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:52,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {17642#(< 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; {17638#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:52,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {17646#(< 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; {17642#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:52,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {17650#(< 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; {17646#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:52,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {17654#(< 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; {17650#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:52,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {17658#(< 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; {17654#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:52,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {17662#(< 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; {17658#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:04:52,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {17473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17662#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:04:52,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {17473#true} call #t~ret11 := main(); {17473#true} is VALID [2022-04-28 10:04:52,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17473#true} {17473#true} #61#return; {17473#true} is VALID [2022-04-28 10:04:52,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {17473#true} assume true; {17473#true} is VALID [2022-04-28 10:04:52,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {17473#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); {17473#true} is VALID [2022-04-28 10:04:52,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {17473#true} call ULTIMATE.init(); {17473#true} is VALID [2022-04-28 10:04:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:04:52,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307193352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:52,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:52,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:04:52,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781034312] [2022-04-28 10:04:52,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781034312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:52,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:52,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:04:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90659474] [2022-04-28 10:04:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:52,291 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 29 [2022-04-28 10:04:52,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:52,292 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-28 10:04:52,309 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-28 10:04:52,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:04:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:04:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:04:52,310 INFO L87 Difference]: Start difference. First operand 89 states and 114 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-28 10:04:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:53,975 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2022-04-28 10:04:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:04:53,975 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 29 [2022-04-28 10:04:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:53,975 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-28 10:04:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 10:04:53,976 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-28 10:04:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 98 transitions. [2022-04-28 10:04:53,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 98 transitions. [2022-04-28 10:04:54,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:54,063 INFO L225 Difference]: With dead ends: 138 [2022-04-28 10:04:54,064 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 10:04:54,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:04:54,064 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:54,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 104 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:04:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 10:04:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-04-28 10:04:54,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:54,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:54,295 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:54,295 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:54,300 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 10:04:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 10:04:54,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:54,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:54,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 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 130 states. [2022-04-28 10:04:54,300 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 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 130 states. [2022-04-28 10:04:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:54,302 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 10:04:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 10:04:54,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:54,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:54,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:54,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2022-04-28 10:04:54,303 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 29 [2022-04-28 10:04:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:54,303 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2022-04-28 10:04:54,303 INFO L496 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-28 10:04:54,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 122 transitions. [2022-04-28 10:04:54,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-28 10:04:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:04:54,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:54,471 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:54,487 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-28 10:04:54,672 WARN L477 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-28 10:04:54,672 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash 751514495, now seen corresponding path program 59 times [2022-04-28 10:04:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:54,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068014418] [2022-04-28 10:04:54,674 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:54,674 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash 751514495, now seen corresponding path program 60 times [2022-04-28 10:04:54,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:54,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379874708] [2022-04-28 10:04:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:54,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {18458#(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); {18441#true} is VALID [2022-04-28 10:04:54,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-28 10:04:54,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-28 10:04:54,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:54,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {18458#(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); {18441#true} is VALID [2022-04-28 10:04:54,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-28 10:04:54,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-28 10:04:54,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-28 10:04:54,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18446#(= main_~y~0 0)} is VALID [2022-04-28 10:04:54,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#(= 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; {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:54,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {18447#(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; {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:54,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {18448#(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; {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:54,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {18449#(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; {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:54,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {18450#(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; {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:54,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:54,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {18452#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:54,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {18452#(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; {18453#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:54,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {18453#(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; {18454#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:54,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#(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; {18455#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:54,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {18455#(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; {18456#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:54,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {18456#(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; {18457#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(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; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#false} assume !(~z~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#false} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-28 10:04:54,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-28 10:04:54,901 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-28 10:04:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:54,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379874708] [2022-04-28 10:04:54,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379874708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:54,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811554489] [2022-04-28 10:04:54,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:54,902 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-28 10:04:54,904 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-28 10:04:54,972 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:54,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:54,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:04:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:54,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:55,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18441#true} is VALID [2022-04-28 10:04:55,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#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); {18441#true} is VALID [2022-04-28 10:04:55,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-28 10:04:55,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-28 10:04:55,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-28 10:04:55,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18446#(= main_~y~0 0)} is VALID [2022-04-28 10:04:55,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#(= 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; {18447#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:55,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {18447#(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; {18448#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:55,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {18448#(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; {18449#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:55,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {18449#(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; {18450#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:55,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {18450#(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; {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {18498#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {18498#(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; {18502#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:55,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {18502#(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; {18506#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {18506#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) 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; {18510#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {18510#(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; {18514#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {18514#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ 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; {18518#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {18518#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 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; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {18442#false} assume !(~z~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {18442#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {18442#false} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-28 10:04:55,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-28 10:04:55,241 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-28 10:04:55,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:55,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {18442#false} assume !false; {18442#false} is VALID [2022-04-28 10:04:55,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {18442#false} assume 0 == ~cond; {18442#false} is VALID [2022-04-28 10:04:55,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {18442#false} ~cond := #in~cond; {18442#false} is VALID [2022-04-28 10:04:55,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {18442#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18442#false} is VALID [2022-04-28 10:04:55,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {18567#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18442#false} is VALID [2022-04-28 10:04:55,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {18571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18567#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:55,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {18575#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:55,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {18579#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18575#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:04:55,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {18583#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18579#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:04:55,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18583#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:55,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:55,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {18594#(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; {18587#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:55,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {18598#(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; {18594#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:04:55,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {18602#(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; {18598#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:55,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {18606#(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; {18602#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:55,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {18610#(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; {18606#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:55,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {18614#(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; {18610#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {18441#true} ~z~0 := ~y~0; {18614#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {18441#true} assume !(~x~0 % 4294967296 > 0); {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {18441#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; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {18441#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; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {18441#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; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {18441#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; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {18441#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; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {18441#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {18441#true} call #t~ret11 := main(); {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18441#true} {18441#true} #61#return; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {18441#true} assume true; {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {18441#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); {18441#true} is VALID [2022-04-28 10:04:55,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {18441#true} call ULTIMATE.init(); {18441#true} is VALID [2022-04-28 10:04:55,616 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-28 10:04:55,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811554489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:55,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:55,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-28 10:04:55,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:55,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068014418] [2022-04-28 10:04:55,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068014418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:55,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:55,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357841568] [2022-04-28 10:04:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:55,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:55,618 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), 14 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-28 10:04:55,634 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-28 10:04:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:04:55,636 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:56,376 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2022-04-28 10:04:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:56,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-28 10:04:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-28 10:04:56,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-28 10:04:56,407 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-28 10:04:56,408 INFO L225 Difference]: With dead ends: 106 [2022-04-28 10:04:56,408 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 10:04:56,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:04:56,409 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:56,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 10:04:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 10:04:56,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:56,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:56,595 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:56,595 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:56,596 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-28 10:04:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-28 10:04:56,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:56,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:56,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 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-28 10:04:56,597 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 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-28 10:04:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:56,598 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-28 10:04:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-28 10:04:56,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:56,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:56,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:56,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-04-28 10:04:56,599 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 30 [2022-04-28 10:04:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:56,600 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-04-28 10:04:56,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-28 10:04:56,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 112 transitions. [2022-04-28 10:04:56,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-28 10:04:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:04:56,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:56,765 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:56,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 10:04:56,971 WARN L477 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-28 10:04:56,971 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 61 times [2022-04-28 10:04:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:56,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931073523] [2022-04-28 10:04:56,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:56,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 62 times [2022-04-28 10:04:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:56,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915165409] [2022-04-28 10:04:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:56,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:57,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {19257#(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); {19240#true} is VALID [2022-04-28 10:04:57,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-28 10:04:57,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-28 10:04:57,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:57,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {19257#(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); {19240#true} is VALID [2022-04-28 10:04:57,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-28 10:04:57,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-28 10:04:57,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-28 10:04:57,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19245#(= main_~y~0 0)} is VALID [2022-04-28 10:04:57,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {19245#(= 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; {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:57,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {19246#(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; {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:57,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {19247#(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; {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:57,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {19248#(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; {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:57,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {19249#(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; {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:57,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {19250#(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; {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19252#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:57,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {19252#(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; {19253#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:57,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {19253#(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; {19254#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:57,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {19254#(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; {19255#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:57,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {19255#(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; {19256#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:57,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {19256#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-28 10:04:57,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-28 10:04:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915165409] [2022-04-28 10:04:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915165409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630491799] [2022-04-28 10:04:57,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:57,192 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-28 10:04:57,207 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-28 10:04:57,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:57,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:57,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:04:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:57,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:57,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19240#true} is VALID [2022-04-28 10:04:57,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#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); {19240#true} is VALID [2022-04-28 10:04:57,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-28 10:04:57,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-28 10:04:57,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-28 10:04:57,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19245#(= main_~y~0 0)} is VALID [2022-04-28 10:04:57,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {19245#(= 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; {19246#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:57,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {19246#(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; {19247#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:57,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {19247#(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; {19248#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:57,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {19248#(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; {19249#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:57,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {19249#(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; {19250#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:57,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {19250#(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; {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {19251#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19300#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {19300#(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; {19304#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:57,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {19304#(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; {19308#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {19308#(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; {19312#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:57,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {19312#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 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; {19316#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {19316#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-28 10:04:57,506 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-28 10:04:57,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-28 10:04:57,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-28 10:04:57,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-28 10:04:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:04:57,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:57,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {19241#false} assume !false; {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {19241#false} assume 0 == ~cond; {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {19241#false} ~cond := #in~cond; {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L272 TraceCheckUtils]: 26: Hoare triple {19241#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {19241#false} assume !(~y~0 % 4294967296 > 0); {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {19241#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {19371#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19241#false} is VALID [2022-04-28 10:04:57,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {19375#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19371#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:57,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {19379#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19375#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:57,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {19383#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19379#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:57,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {19387#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19383#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:57,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {19391#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19387#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:04:57,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {19395#(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; {19391#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:57,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {19399#(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; {19395#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:57,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {19403#(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; {19399#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:57,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {19407#(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; {19403#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:57,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {19240#true} ~z~0 := ~y~0; {19407#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:04:57,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {19240#true} assume !(~x~0 % 4294967296 > 0); {19240#true} is VALID [2022-04-28 10:04:57,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {19240#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; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {19240#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {19240#true} call #t~ret11 := main(); {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19240#true} {19240#true} #61#return; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {19240#true} assume true; {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {19240#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); {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {19240#true} call ULTIMATE.init(); {19240#true} is VALID [2022-04-28 10:04:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:04:57,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630491799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:57,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:57,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30 [2022-04-28 10:04:57,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931073523] [2022-04-28 10:04:57,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931073523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:57,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:57,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972017292] [2022-04-28 10:04:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:57,815 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 30 [2022-04-28 10:04:57,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:57,816 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-28 10:04:57,834 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-28 10:04:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:57,835 INFO L87 Difference]: Start difference. First operand 87 states and 112 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-28 10:04:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:58,777 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2022-04-28 10:04:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:58,777 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 30 [2022-04-28 10:04:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:58,777 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-28 10:04:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-28 10:04:58,778 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-28 10:04:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-28 10:04:58,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 48 transitions. [2022-04-28 10:04:58,816 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-28 10:04:58,817 INFO L225 Difference]: With dead ends: 108 [2022-04-28 10:04:58,817 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:04:58,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:04:58,818 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:58,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:04:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-04-28 10:04:59,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:59,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:59,009 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:59,009 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:59,010 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-28 10:04:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-04-28 10:04:59,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:59,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:59,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 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 96 states. [2022-04-28 10:04:59,010 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 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 96 states. [2022-04-28 10:04:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:59,012 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-28 10:04:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-04-28 10:04:59,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:59,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:59,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:59,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:04:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2022-04-28 10:04:59,013 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 30 [2022-04-28 10:04:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:59,013 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2022-04-28 10:04:59,013 INFO L496 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-28 10:04:59,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 113 transitions. [2022-04-28 10:04:59,169 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-28 10:04:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2022-04-28 10:04:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:04:59,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:59,170 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:59,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 10:04:59,370 WARN L477 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-28 10:04:59,370 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 63 times [2022-04-28 10:04:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:59,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609209452] [2022-04-28 10:04:59,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:59,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 64 times [2022-04-28 10:04:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906114558] [2022-04-28 10:04:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {20076#(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); {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:59,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {20076#(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); {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-28 10:04:59,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-28 10:04:59,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20065#(= main_~y~0 0)} is VALID [2022-04-28 10:04:59,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {20065#(= 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; {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:59,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {20066#(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; {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:59,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {20067#(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; {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:59,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {20068#(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; {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:59,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {20069#(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; {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:59,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {20070#(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; {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:59,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {20071#(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; {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:59,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:59,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:04:59,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {20073#(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; {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:59,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {20074#(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; {20075#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {20075#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:04:59,572 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-28 10:04:59,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-28 10:04:59,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-28 10:04:59,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-28 10:04:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:04:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906114558] [2022-04-28 10:04:59,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906114558] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319085616] [2022-04-28 10:04:59,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:59,574 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-28 10:04:59,603 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-28 10:04:59,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:59,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:59,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:59,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:59,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20060#true} is VALID [2022-04-28 10:04:59,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#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); {20060#true} is VALID [2022-04-28 10:04:59,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-28 10:04:59,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-28 10:04:59,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-28 10:04:59,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20065#(= main_~y~0 0)} is VALID [2022-04-28 10:04:59,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {20065#(= 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; {20066#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:59,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {20066#(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; {20067#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:59,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {20067#(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; {20068#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:59,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {20068#(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; {20069#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:59,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {20069#(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; {20070#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:59,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {20070#(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; {20071#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:59,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {20071#(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; {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:59,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:59,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {20072#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20073#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:04:59,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {20073#(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; {20074#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:59,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {20074#(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; {20128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {20128#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-28 10:04:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:04:59,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {20061#false} assume !false; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {20061#false} assume 0 == ~cond; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {20061#false} ~cond := #in~cond; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L272 TraceCheckUtils]: 26: Hoare triple {20061#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {20061#false} assume !(~y~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {20061#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20061#false} is VALID [2022-04-28 10:05:00,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {20204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20061#false} is VALID [2022-04-28 10:05:00,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {20208#(< 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; {20204#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:00,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {20212#(< 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; {20208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:00,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {20212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:00,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:00,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {20223#(< 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; {20216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:00,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {20227#(< 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; {20223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:00,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {20231#(< 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; {20227#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:00,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {20235#(< 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; {20231#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:00,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {20239#(< 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; {20235#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:00,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {20243#(< 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; {20239#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:00,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {20247#(< 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; {20243#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:00,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {20060#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20247#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:00,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {20060#true} call #t~ret11 := main(); {20060#true} is VALID [2022-04-28 10:05:00,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20060#true} {20060#true} #61#return; {20060#true} is VALID [2022-04-28 10:05:00,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {20060#true} assume true; {20060#true} is VALID [2022-04-28 10:05:00,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {20060#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); {20060#true} is VALID [2022-04-28 10:05:00,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {20060#true} call ULTIMATE.init(); {20060#true} is VALID [2022-04-28 10:05:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319085616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:00,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:05:00,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609209452] [2022-04-28 10:05:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609209452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:00,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:05:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430551879] [2022-04-28 10:05:00,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:00,150 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 30 [2022-04-28 10:05:00,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:00,150 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-28 10:05:00,165 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-28 10:05:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:05:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:05:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:05:00,166 INFO L87 Difference]: Start difference. First operand 88 states and 113 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-28 10:05:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:01,065 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-28 10:05:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:05:01,065 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 30 [2022-04-28 10:05:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:01,065 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-28 10:05:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:05:01,066 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-28 10:05:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:05:01,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-28 10:05:01,107 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-28 10:05:01,109 INFO L225 Difference]: With dead ends: 111 [2022-04-28 10:05:01,109 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 10:05:01,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:05:01,111 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:01,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 73 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 10:05:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-28 10:05:01,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:01,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:01,307 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:01,307 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:01,308 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-28 10:05:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2022-04-28 10:05:01,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:01,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:01,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 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 98 states. [2022-04-28 10:05:01,308 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 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 98 states. [2022-04-28 10:05:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:01,309 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-28 10:05:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2022-04-28 10:05:01,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:01,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:01,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:01,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-04-28 10:05:01,310 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 30 [2022-04-28 10:05:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:01,310 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-04-28 10:05:01,310 INFO L496 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-28 10:05:01,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 114 transitions. [2022-04-28 10:05:01,466 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-28 10:05:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-04-28 10:05:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:05:01,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:01,467 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:01,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 10:05:01,667 WARN L477 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-28 10:05:01,667 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:01,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1426165966, now seen corresponding path program 65 times [2022-04-28 10:05:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1149996947] [2022-04-28 10:05:01,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:01,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1426165966, now seen corresponding path program 66 times [2022-04-28 10:05:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:01,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859065867] [2022-04-28 10:05:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:01,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {20911#(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); {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:01,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {20911#(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); {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-28 10:05:01,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20895#(= main_~y~0 0)} is VALID [2022-04-28 10:05:01,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {20895#(= 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; {20896#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:01,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {20896#(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; {20897#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:01,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {20897#(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; {20898#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:01,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {20898#(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; {20899#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:01,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {20899#(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; {20900#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:01,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {20900#(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; {20901#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:01,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {20901#(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; {20902#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:01,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {20902#(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; {20903#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:01,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {20903#(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; {20904#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:01,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {20904#(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; {20905#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:01,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {20905#(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; {20906#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:01,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {20906#(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; {20907#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:01,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {20907#(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; {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:01,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:01,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {20908#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {20909#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:05:01,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {20909#(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; {20910#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {20910#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {20891#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-28 10:05:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859065867] [2022-04-28 10:05:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859065867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630306766] [2022-04-28 10:05:01,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:01,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:01,945 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-28 10:05:01,946 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-28 10:05:01,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:05:01,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:01,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:05:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:01,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:02,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#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); {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {20890#true} assume !(~x~0 % 4294967296 > 0); {20890#true} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {20890#true} ~z~0 := ~y~0; {20975#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:05:02,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {20975#(= 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; {20979#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:05:02,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {20979#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:02,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20987#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:02,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {20987#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-28 10:05:02,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-28 10:05:02,105 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-28 10:05:02,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-28 10:05:02,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-28 10:05:02,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-28 10:05:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:05:02,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:02,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {20891#false} assume !false; {20891#false} is VALID [2022-04-28 10:05:02,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {20891#false} assume 0 == ~cond; {20891#false} is VALID [2022-04-28 10:05:02,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {20891#false} ~cond := #in~cond; {20891#false} is VALID [2022-04-28 10:05:02,219 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20891#false} is VALID [2022-04-28 10:05:02,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#false} assume !(~y~0 % 4294967296 > 0); {20891#false} is VALID [2022-04-28 10:05:02,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {20987#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20891#false} is VALID [2022-04-28 10:05:02,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20987#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:02,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {21027#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20983#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:02,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {21031#(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; {21027#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:02,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {20890#true} ~z~0 := ~y~0; {21031#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:02,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {20890#true} assume !(~x~0 % 4294967296 > 0); {20890#true} is VALID [2022-04-28 10:05:02,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {20890#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; {20890#true} is VALID [2022-04-28 10:05:02,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {20890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {20890#true} call #t~ret11 := main(); {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20890#true} {20890#true} #61#return; {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {20890#true} assume true; {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {20890#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); {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {20890#true} call ULTIMATE.init(); {20890#true} is VALID [2022-04-28 10:05:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:05:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630306766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:02,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:02,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 25 [2022-04-28 10:05:02,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1149996947] [2022-04-28 10:05:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1149996947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:02,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:02,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722097671] [2022-04-28 10:05:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:02,233 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 30 [2022-04-28 10:05:02,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:02,234 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-28 10:05:02,258 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-28 10:05:02,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:02,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:02,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:05:02,259 INFO L87 Difference]: Start difference. First operand 89 states and 114 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-28 10:05:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:04,120 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-04-28 10:05:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:05:04,120 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 30 [2022-04-28 10:05:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:04,121 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-28 10:05:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-28 10:05:04,121 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-28 10:05:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 101 transitions. [2022-04-28 10:05:04,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 101 transitions. [2022-04-28 10:05:04,202 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-28 10:05:04,203 INFO L225 Difference]: With dead ends: 139 [2022-04-28 10:05:04,203 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 10:05:04,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:05:04,204 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:04,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 109 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:05:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 10:05:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 95. [2022-04-28 10:05:04,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:04,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:04,439 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:04,440 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:04,441 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 10:05:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 10:05:04,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:04,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:04,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 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 131 states. [2022-04-28 10:05:04,441 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 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 131 states. [2022-04-28 10:05:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:04,443 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 10:05:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 10:05:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:04,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:04,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:04,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2022-04-28 10:05:04,445 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 30 [2022-04-28 10:05:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:04,445 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2022-04-28 10:05:04,445 INFO L496 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-28 10:05:04,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 122 transitions. [2022-04-28 10:05:04,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-28 10:05:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:05:04,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:04,622 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:04,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 10:05:04,822 WARN L477 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-28 10:05:04,823 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 67 times [2022-04-28 10:05:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:04,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826053148] [2022-04-28 10:05:04,825 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:04,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 68 times [2022-04-28 10:05:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:04,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114012328] [2022-04-28 10:05:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:05,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:05,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {21879#(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); {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {21879#(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); {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-28 10:05:05,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21866#(= main_~y~0 0)} is VALID [2022-04-28 10:05:05,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {21866#(= 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; {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:05,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {21867#(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; {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:05,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {21868#(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; {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:05,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {21869#(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; {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:05,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#(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; {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:05,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {21871#(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; {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {21873#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:05,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {21873#(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; {21874#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:05,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {21874#(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; {21875#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:05,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(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; {21876#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:05,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {21876#(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; {21877#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {21877#(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; {21878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {21878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-28 10:05:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:05,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114012328] [2022-04-28 10:05:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114012328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074623267] [2022-04-28 10:05:05,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:05,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:05,052 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-28 10:05:05,061 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-28 10:05:05,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:05,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:05,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:05:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:05,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:05,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21861#true} is VALID [2022-04-28 10:05:05,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#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); {21861#true} is VALID [2022-04-28 10:05:05,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-28 10:05:05,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-28 10:05:05,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-28 10:05:05,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21866#(= main_~y~0 0)} is VALID [2022-04-28 10:05:05,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {21866#(= 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; {21867#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:05,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {21867#(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; {21868#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:05,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {21868#(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; {21869#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:05,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {21869#(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; {21870#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:05,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#(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; {21871#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:05,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {21871#(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; {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {21872#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {21922#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {21922#(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; {21926#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:05,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {21926#(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; {21930#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {21930#(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; {21934#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:05:05,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {21934#(and (<= main_~y~0 6) (<= 6 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; {21938#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {21938#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ 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; {21942#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {21942#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {21862#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-28 10:05:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:05,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:05,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {21862#false} assume !false; {21862#false} is VALID [2022-04-28 10:05:05,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {21862#false} assume 0 == ~cond; {21862#false} is VALID [2022-04-28 10:05:05,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {21862#false} ~cond := #in~cond; {21862#false} is VALID [2022-04-28 10:05:05,711 INFO L272 TraceCheckUtils]: 27: Hoare triple {21862#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {21862#false} is VALID [2022-04-28 10:05:05,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {21862#false} assume !(~y~0 % 4294967296 > 0); {21862#false} is VALID [2022-04-28 10:05:05,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {21994#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21862#false} is VALID [2022-04-28 10:05:05,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {21998#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21994#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:05,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {22002#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {21998#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:05,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {22006#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22002#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:05,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {22010#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22006#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:05,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {22014#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22010#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:05,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {22018#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22014#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:05,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {22022#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {22018#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:05:05,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {22026#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {22022#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:05,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {22030#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {22026#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:05,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {22034#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {22030#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:05,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {22038#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {22034#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {21861#true} ~z~0 := ~y~0; {22038#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {21861#true} assume !(~x~0 % 4294967296 > 0); {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {21861#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; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {21861#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {21861#true} call #t~ret11 := main(); {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21861#true} {21861#true} #61#return; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#true} assume true; {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {21861#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); {21861#true} is VALID [2022-04-28 10:05:05,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {21861#true} call ULTIMATE.init(); {21861#true} is VALID [2022-04-28 10:05:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:05,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074623267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:05,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:05,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 34 [2022-04-28 10:05:05,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:05,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826053148] [2022-04-28 10:05:05,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826053148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:05,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:05,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:05:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120445731] [2022-04-28 10:05:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:05,722 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 31 [2022-04-28 10:05:05,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:05,722 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-28 10:05:05,740 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-28 10:05:05,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:05:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:05:05,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:05,741 INFO L87 Difference]: Start difference. First operand 95 states and 122 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-28 10:05:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:06,820 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-28 10:05:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:05:06,820 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 31 [2022-04-28 10:05:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:06,820 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-28 10:05:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 10:05:06,821 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-28 10:05:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 10:05:06,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-28 10:05:06,858 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-28 10:05:06,859 INFO L225 Difference]: With dead ends: 116 [2022-04-28 10:05:06,859 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 10:05:06,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:05:06,860 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:06,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 10:05:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-04-28 10:05:07,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:07,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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-28 10:05:07,081 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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-28 10:05:07,081 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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-28 10:05:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:07,083 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-04-28 10:05:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2022-04-28 10:05:07,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:07,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:07,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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 104 states. [2022-04-28 10:05:07,084 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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 104 states. [2022-04-28 10:05:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:07,085 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-04-28 10:05:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2022-04-28 10:05:07,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:07,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:07,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:07,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 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-28 10:05:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-04-28 10:05:07,087 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 31 [2022-04-28 10:05:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:07,087 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-04-28 10:05:07,087 INFO L496 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-28 10:05:07,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 123 transitions. [2022-04-28 10:05:07,275 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-28 10:05:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-04-28 10:05:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:05:07,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:07,276 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:07,301 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-28 10:05:07,497 WARN L477 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-28 10:05:07,497 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 69 times [2022-04-28 10:05:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:07,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269017588] [2022-04-28 10:05:07,500 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:07,500 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 70 times [2022-04-28 10:05:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:07,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20116142] [2022-04-28 10:05:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:07,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {22758#(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); {22741#true} is VALID [2022-04-28 10:05:07,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-28 10:05:07,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-28 10:05:07,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:07,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {22758#(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); {22741#true} is VALID [2022-04-28 10:05:07,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-28 10:05:07,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-28 10:05:07,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-28 10:05:07,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#(= main_~y~0 0)} is VALID [2022-04-28 10:05:07,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#(= 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; {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:07,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(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; {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:07,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(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; {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:07,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {22749#(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; {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:07,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {22750#(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; {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:07,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {22751#(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; {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:07,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {22752#(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; {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:07,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:07,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:07,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {22754#(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; {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:07,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {22755#(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; {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {22756#(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; {22757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {22757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-28 10:05:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20116142] [2022-04-28 10:05:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20116142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593995689] [2022-04-28 10:05:07,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:07,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:07,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:07,688 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-28 10:05:07,689 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-28 10:05:07,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:07,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:07,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:05:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:07,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:08,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22741#true} is VALID [2022-04-28 10:05:08,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#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); {22741#true} is VALID [2022-04-28 10:05:08,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-28 10:05:08,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-28 10:05:08,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-28 10:05:08,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22746#(= main_~y~0 0)} is VALID [2022-04-28 10:05:08,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {22746#(= 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; {22747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:08,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(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; {22748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:08,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(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; {22749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:08,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {22749#(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; {22750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:08,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {22750#(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; {22751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:08,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {22751#(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; {22752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:08,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {22752#(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; {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:08,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:08,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {22753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22754#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:08,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {22754#(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; {22755#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:08,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {22755#(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; {22756#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {22756#(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; {22813#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {22813#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-28 10:05:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:08,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {22742#false} assume !false; {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {22742#false} assume 0 == ~cond; {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {22742#false} ~cond := #in~cond; {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {22742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {22742#false} assume !(~y~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {22742#false} is VALID [2022-04-28 10:05:08,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {22889#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22742#false} is VALID [2022-04-28 10:05:08,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {22893#(< 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; {22889#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:08,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {22897#(< 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; {22893#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:08,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {22901#(< 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; {22897#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:08,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {22901#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:08,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:08,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(< 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; {22905#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:08,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {22916#(< 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; {22912#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:08,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {22920#(< 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; {22916#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:08,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {22924#(< 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; {22920#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:08,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {22928#(< 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; {22924#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:08,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {22932#(< 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; {22928#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:08,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {22936#(< 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; {22932#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:08,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {22741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22936#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:08,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {22741#true} call #t~ret11 := main(); {22741#true} is VALID [2022-04-28 10:05:08,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22741#true} {22741#true} #61#return; {22741#true} is VALID [2022-04-28 10:05:08,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {22741#true} assume true; {22741#true} is VALID [2022-04-28 10:05:08,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {22741#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); {22741#true} is VALID [2022-04-28 10:05:08,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {22741#true} call ULTIMATE.init(); {22741#true} is VALID [2022-04-28 10:05:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593995689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:08,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:08,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:05:08,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:08,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269017588] [2022-04-28 10:05:08,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269017588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:08,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:08,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:05:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379298043] [2022-04-28 10:05:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:08,307 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 31 [2022-04-28 10:05:08,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:08,307 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-28 10:05:08,323 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-28 10:05:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:05:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:05:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:05:08,324 INFO L87 Difference]: Start difference. First operand 96 states and 123 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-28 10:05:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,321 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-04-28 10:05:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:09,321 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 31 [2022-04-28 10:05:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:09,321 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-28 10:05:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 10:05:09,322 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-28 10:05:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 10:05:09,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-28 10:05:09,364 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-28 10:05:09,365 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:05:09,365 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 10:05:09,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:05:09,366 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:09,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 10:05:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-04-28 10:05:09,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:09,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:09,585 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:09,585 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,586 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-28 10:05:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-28 10:05:09,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:09,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:09,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 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 106 states. [2022-04-28 10:05:09,587 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 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 106 states. [2022-04-28 10:05:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:09,588 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-28 10:05:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-28 10:05:09,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:09,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:09,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:09,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2022-04-28 10:05:09,590 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 31 [2022-04-28 10:05:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:09,590 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2022-04-28 10:05:09,590 INFO L496 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-28 10:05:09,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 124 transitions. [2022-04-28 10:05:09,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2022-04-28 10:05:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:05:09,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:09,785 INFO L195 NwaCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:09,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 10:05:09,985 WARN L477 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-28 10:05:09,986 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 717920815, now seen corresponding path program 71 times [2022-04-28 10:05:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:09,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829971594] [2022-04-28 10:05:09,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:09,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 717920815, now seen corresponding path program 72 times [2022-04-28 10:05:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:09,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379984500] [2022-04-28 10:05:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {23653#(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); {23631#true} is VALID [2022-04-28 10:05:10,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-28 10:05:10,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-28 10:05:10,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23653#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:10,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {23653#(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); {23631#true} is VALID [2022-04-28 10:05:10,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-28 10:05:10,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-28 10:05:10,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-28 10:05:10,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23636#(= main_~y~0 0)} is VALID [2022-04-28 10:05:10,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {23636#(= 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; {23637#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:10,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {23637#(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; {23638#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:10,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {23638#(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; {23639#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:10,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {23639#(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; {23640#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:10,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {23640#(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; {23641#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:10,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {23641#(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; {23642#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:10,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {23642#(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; {23643#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:10,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {23643#(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; {23644#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:10,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {23644#(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; {23645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:10,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {23645#(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; {23646#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:10,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {23646#(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; {23647#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:10,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {23647#(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; {23648#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:10,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {23648#(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; {23649#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:10,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {23649#(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; {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:10,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:10,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {23650#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {23651#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {23651#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23652#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {23652#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {23632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {23632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-28 10:05:10,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-28 10:05:10,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-28 10:05:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:10,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379984500] [2022-04-28 10:05:10,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379984500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:10,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823173759] [2022-04-28 10:05:10,283 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:10,284 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-28 10:05:10,285 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-28 10:05:10,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:05:10,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:05:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:10,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:10,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23631#true} is VALID [2022-04-28 10:05:10,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#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); {23631#true} is VALID [2022-04-28 10:05:10,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-28 10:05:10,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-28 10:05:10,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-28 10:05:10,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {23631#true} assume !(~x~0 % 4294967296 > 0); {23631#true} is VALID [2022-04-28 10:05:10,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {23631#true} ~z~0 := ~y~0; {23720#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:05:10,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {23720#(= 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; {23724#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:05:10,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {23724#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:10,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23732#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:10,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {23732#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-28 10:05:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:05:10,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:10,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {23632#false} assume !false; {23632#false} is VALID [2022-04-28 10:05:10,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {23632#false} assume 0 == ~cond; {23632#false} is VALID [2022-04-28 10:05:10,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {23632#false} ~cond := #in~cond; {23632#false} is VALID [2022-04-28 10:05:10,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {23632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {23632#false} is VALID [2022-04-28 10:05:10,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {23632#false} assume !(~y~0 % 4294967296 > 0); {23632#false} is VALID [2022-04-28 10:05:10,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {23732#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23632#false} is VALID [2022-04-28 10:05:10,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {23732#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:10,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {23772#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {23728#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:10,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {23776#(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; {23772#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {23631#true} ~z~0 := ~y~0; {23776#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {23631#true} assume !(~x~0 % 4294967296 > 0); {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {23631#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; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {23631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {23631#true} call #t~ret11 := main(); {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23631#true} {23631#true} #61#return; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {23631#true} assume true; {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {23631#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); {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {23631#true} call ULTIMATE.init(); {23631#true} is VALID [2022-04-28 10:05:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:05:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823173759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:10,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:10,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 6, 6] total 26 [2022-04-28 10:05:10,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:10,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829971594] [2022-04-28 10:05:10,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829971594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:10,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:10,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:05:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017981471] [2022-04-28 10:05:10,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:10,577 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 31 [2022-04-28 10:05:10,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:10,578 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-28 10:05:10,596 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-28 10:05:10,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:05:10,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:05:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:05:10,597 INFO L87 Difference]: Start difference. First operand 97 states and 124 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-28 10:05:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:12,697 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2022-04-28 10:05:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:05:12,697 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 31 [2022-04-28 10:05:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:12,697 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-28 10:05:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-28 10:05:12,698 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-28 10:05:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 108 transitions. [2022-04-28 10:05:12,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 108 transitions. [2022-04-28 10:05:12,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:12,783 INFO L225 Difference]: With dead ends: 148 [2022-04-28 10:05:12,783 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 10:05:12,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=1739, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:05:12,784 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:12,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 117 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:05:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 10:05:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2022-04-28 10:05:13,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:13,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:13,021 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:13,021 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:13,022 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-28 10:05:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2022-04-28 10:05:13,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:13,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:13,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 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 140 states. [2022-04-28 10:05:13,023 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 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 140 states. [2022-04-28 10:05:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:13,024 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-28 10:05:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2022-04-28 10:05:13,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:13,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:13,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:13,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2022-04-28 10:05:13,026 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 31 [2022-04-28 10:05:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:13,027 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2022-04-28 10:05:13,027 INFO L496 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-28 10:05:13,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 132 transitions. [2022-04-28 10:05:13,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2022-04-28 10:05:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:05:13,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:13,230 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:13,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 10:05:13,430 WARN L477 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-28 10:05:13,431 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 73 times [2022-04-28 10:05:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864256991] [2022-04-28 10:05:13,434 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:13,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 74 times [2022-04-28 10:05:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:13,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018001573] [2022-04-28 10:05:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {24677#(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); {24663#true} is VALID [2022-04-28 10:05:13,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-28 10:05:13,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-28 10:05:13,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:13,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {24677#(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); {24663#true} is VALID [2022-04-28 10:05:13,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= 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; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:13,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= 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; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= 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; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= 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; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= 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; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:13,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= 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; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:13,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:13,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,642 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:05:13,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {24675#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24676#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:05:13,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {24676#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24664#false} is VALID [2022-04-28 10:05:13,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-28 10:05:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018001573] [2022-04-28 10:05:13,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018001573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:13,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271256696] [2022-04-28 10:05:13,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:13,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:13,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:13,645 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-28 10:05:13,646 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-28 10:05:13,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:13,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:13,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:05:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:13,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:13,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#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); {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:13,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:13,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= 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; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:13,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= 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; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:13,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= 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; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= 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; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= 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; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:14,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= 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; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:14,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:14,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,017 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:14,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:14,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {24769#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24664#false} is VALID [2022-04-28 10:05:14,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-28 10:05:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:14,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:14,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {24664#false} assume !false; {24664#false} is VALID [2022-04-28 10:05:14,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {24769#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24664#false} is VALID [2022-04-28 10:05:14,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24769#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:14,282 INFO L272 TraceCheckUtils]: 28: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24765#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:14,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:14,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:14,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {24673#(<= 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; {24674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {24672#(<= 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; {24673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:14,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {24671#(<= 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; {24672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {24670#(<= 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; {24671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {24669#(<= 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; {24670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:14,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {24668#(<= 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; {24669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:14,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {24663#true} assume !(~x~0 % 4294967296 > 0); {24668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:14,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {24663#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; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {24663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {24663#true} call #t~ret11 := main(); {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24663#true} {24663#true} #61#return; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {24663#true} assume true; {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {24663#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); {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {24663#true} call ULTIMATE.init(); {24663#true} is VALID [2022-04-28 10:05:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:14,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271256696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:14,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-28 10:05:14,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864256991] [2022-04-28 10:05:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864256991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:14,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:05:14,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349554204] [2022-04-28 10:05:14,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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 32 [2022-04-28 10:05:14,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:14,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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-28 10:05:14,323 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-28 10:05:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:05:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:05:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:05:14,324 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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-28 10:05:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:15,830 INFO L93 Difference]: Finished difference Result 242 states and 316 transitions. [2022-04-28 10:05:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:05:15,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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 32 [2022-04-28 10:05:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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-28 10:05:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-28 10:05:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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-28 10:05:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-28 10:05:15,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-28 10:05:15,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:15,887 INFO L225 Difference]: With dead ends: 242 [2022-04-28 10:05:15,887 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 10:05:15,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:05:15,888 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:15,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 76 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 10:05:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 107. [2022-04-28 10:05:16,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:16,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:16,146 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:16,146 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:16,148 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2022-04-28 10:05:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2022-04-28 10:05:16,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:16,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:16,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:05:16,149 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:05:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:16,152 INFO L93 Difference]: Finished difference Result 230 states and 303 transitions. [2022-04-28 10:05:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 303 transitions. [2022-04-28 10:05:16,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:16,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:16,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:16,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2022-04-28 10:05:16,154 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 32 [2022-04-28 10:05:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:16,154 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2022-04-28 10:05:16,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 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-28 10:05:16,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 138 transitions. [2022-04-28 10:05:16,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-28 10:05:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:05:16,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:16,378 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:16,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-28 10:05:16,578 WARN L477 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-28 10:05:16,578 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 75 times [2022-04-28 10:05:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:16,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648027873] [2022-04-28 10:05:16,581 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:16,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 76 times [2022-04-28 10:05:16,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:16,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532980748] [2022-04-28 10:05:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {26065#(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); {26047#true} is VALID [2022-04-28 10:05:16,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-28 10:05:16,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-28 10:05:16,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:16,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {26065#(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); {26047#true} is VALID [2022-04-28 10:05:16,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-28 10:05:16,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-28 10:05:16,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-28 10:05:16,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26052#(= main_~y~0 0)} is VALID [2022-04-28 10:05:16,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {26052#(= 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; {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:16,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {26053#(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; {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:16,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {26054#(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; {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:16,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {26055#(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; {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:16,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {26056#(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; {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:16,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#(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; {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:16,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {26058#(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; {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:16,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:16,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26060#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:16,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {26060#(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; {26061#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:16,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {26061#(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; {26062#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:16,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {26062#(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; {26063#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {26063#(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; {26064#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {26064#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-28 10:05:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:16,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:16,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532980748] [2022-04-28 10:05:16,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532980748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:16,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877846132] [2022-04-28 10:05:16,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:16,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:16,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:16,801 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-28 10:05:16,803 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-28 10:05:16,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:16,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:16,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:05:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:16,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:17,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26047#true} is VALID [2022-04-28 10:05:17,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#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); {26047#true} is VALID [2022-04-28 10:05:17,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-28 10:05:17,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-28 10:05:17,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-28 10:05:17,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26052#(= main_~y~0 0)} is VALID [2022-04-28 10:05:17,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {26052#(= 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; {26053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:17,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {26053#(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; {26054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:17,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {26054#(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; {26055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:17,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {26055#(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; {26056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:17,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {26056#(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; {26057#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:17,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {26057#(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; {26058#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:17,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {26058#(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; {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:17,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:17,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {26059#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26111#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:17,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {26111#(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; {26115#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:17,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {26115#(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; {26119#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:17,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {26119#(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; {26123#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:17,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {26123#(and (= (+ (- 2) main_~y~0) (+ 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; {26127#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:05:17,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {26127#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-28 10:05:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:17,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {26048#false} assume !false; {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {26048#false} assume 0 == ~cond; {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {26048#false} ~cond := #in~cond; {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {26048#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {26048#false} assume !(~y~0 % 4294967296 > 0); {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {26048#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {26188#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26048#false} is VALID [2022-04-28 10:05:17,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {26192#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26188#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:17,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {26196#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26192#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:17,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {26200#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26196#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:17,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {26204#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {26200#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:17,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {26208#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {26204#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:17,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {26212#(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; {26208#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:17,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {26216#(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; {26212#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:17,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {26220#(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; {26216#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:17,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {26224#(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; {26220#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:17,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {26047#true} ~z~0 := ~y~0; {26224#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:17,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {26047#true} assume !(~x~0 % 4294967296 > 0); {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {26047#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; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {26047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {26047#true} call #t~ret11 := main(); {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26047#true} {26047#true} #61#return; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {26047#true} assume true; {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#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); {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {26047#true} call ULTIMATE.init(); {26047#true} is VALID [2022-04-28 10:05:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:05:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877846132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:17,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:17,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-28 10:05:17,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648027873] [2022-04-28 10:05:17,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648027873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:17,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:17,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:05:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570043262] [2022-04-28 10:05:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:17,404 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 32 [2022-04-28 10:05:17,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:17,405 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-28 10:05:17,421 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-28 10:05:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:05:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:05:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:05:17,422 INFO L87 Difference]: Start difference. First operand 107 states and 138 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-28 10:05:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,544 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 10:05:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:05:18,544 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 32 [2022-04-28 10:05:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:18,544 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-28 10:05:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2022-04-28 10:05:18,545 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-28 10:05:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 58 transitions. [2022-04-28 10:05:18,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 58 transitions. [2022-04-28 10:05:18,589 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-28 10:05:18,590 INFO L225 Difference]: With dead ends: 130 [2022-04-28 10:05:18,590 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:05:18,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 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-28 10:05:18,591 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:18,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:05:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2022-04-28 10:05:18,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:18,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:18,852 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:18,853 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,855 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-04-28 10:05:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-04-28 10:05:18,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 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 117 states. [2022-04-28 10:05:18,855 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 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 117 states. [2022-04-28 10:05:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,857 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-04-28 10:05:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2022-04-28 10:05:18,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:18,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-28 10:05:18,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 32 [2022-04-28 10:05:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:18,859 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-28 10:05:18,859 INFO L496 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-28 10:05:18,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 139 transitions. [2022-04-28 10:05:19,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-28 10:05:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:05:19,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:19,138 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:19,163 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-28 10:05:19,339 WARN L477 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-28 10:05:19,339 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 77 times [2022-04-28 10:05:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196048156] [2022-04-28 10:05:19,342 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:19,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 78 times [2022-04-28 10:05:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:19,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174168960] [2022-04-28 10:05:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {27033#(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); {27016#true} is VALID [2022-04-28 10:05:19,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-28 10:05:19,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-28 10:05:19,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:19,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {27033#(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); {27016#true} is VALID [2022-04-28 10:05:19,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-28 10:05:19,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-28 10:05:19,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-28 10:05:19,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27021#(= main_~y~0 0)} is VALID [2022-04-28 10:05:19,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {27021#(= 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; {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:19,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {27022#(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; {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:19,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {27023#(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; {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:19,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {27024#(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; {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:19,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {27025#(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; {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:19,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {27026#(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; {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:19,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {27027#(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; {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:19,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {27028#(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; {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:19,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:19,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:19,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {27030#(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; {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:19,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {27031#(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; {27032#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {27032#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:19,559 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-28 10:05:19,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-28 10:05:19,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-28 10:05:19,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-28 10:05:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:19,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174168960] [2022-04-28 10:05:19,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174168960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:19,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662494242] [2022-04-28 10:05:19,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:19,562 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-28 10:05:19,563 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-28 10:05:19,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:05:19,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:19,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:05:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:19,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:19,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27016#true} is VALID [2022-04-28 10:05:19,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#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); {27016#true} is VALID [2022-04-28 10:05:19,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-28 10:05:19,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-28 10:05:19,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-28 10:05:19,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27021#(= main_~y~0 0)} is VALID [2022-04-28 10:05:19,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {27021#(= 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; {27022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:19,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {27022#(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; {27023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:19,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {27023#(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; {27024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:19,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {27024#(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; {27025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:19,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {27025#(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; {27026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:19,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {27026#(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; {27027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:19,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {27027#(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; {27028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:19,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {27028#(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; {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:19,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:19,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {27029#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27030#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:19,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {27030#(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; {27031#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:19,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {27031#(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; {27088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:19,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {27088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:19,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-28 10:05:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:19,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:20,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {27017#false} assume !false; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {27017#false} assume 0 == ~cond; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#false} ~cond := #in~cond; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L272 TraceCheckUtils]: 28: Hoare triple {27017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#false} assume !(~y~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27017#false} is VALID [2022-04-28 10:05:20,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {27170#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27017#false} is VALID [2022-04-28 10:05:20,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {27174#(< 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; {27170#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:20,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {27178#(< 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; {27174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:20,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {27178#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:20,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:20,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {27189#(< 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; {27182#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:20,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {27193#(< 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; {27189#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:20,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {27197#(< 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; {27193#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:20,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {27201#(< 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; {27197#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:20,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {27205#(< 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; {27201#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:20,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {27209#(< 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; {27205#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:20,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {27213#(< 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; {27209#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:20,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {27217#(< 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; {27213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:20,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {27016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27217#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:20,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {27016#true} call #t~ret11 := main(); {27016#true} is VALID [2022-04-28 10:05:20,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27016#true} {27016#true} #61#return; {27016#true} is VALID [2022-04-28 10:05:20,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {27016#true} assume true; {27016#true} is VALID [2022-04-28 10:05:20,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#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); {27016#true} is VALID [2022-04-28 10:05:20,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {27016#true} call ULTIMATE.init(); {27016#true} is VALID [2022-04-28 10:05:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662494242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:20,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:05:20,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:20,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196048156] [2022-04-28 10:05:20,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196048156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:20,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:05:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102562213] [2022-04-28 10:05:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:20,330 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 32 [2022-04-28 10:05:20,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:20,330 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-28 10:05:20,346 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-28 10:05:20,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:05:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:20,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:05:20,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:05:20,347 INFO L87 Difference]: Start difference. First operand 108 states and 139 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-28 10:05:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:21,457 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2022-04-28 10:05:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:21,457 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 32 [2022-04-28 10:05:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:21,457 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-28 10:05:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-28 10:05:21,458 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-28 10:05:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-28 10:05:21,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2022-04-28 10:05:21,505 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-28 10:05:21,506 INFO L225 Difference]: With dead ends: 133 [2022-04-28 10:05:21,506 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 10:05:21,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 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-28 10:05:21,507 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:21,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 75 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 10:05:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-28 10:05:21,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:21,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:21,785 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:21,785 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:21,786 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2022-04-28 10:05:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-04-28 10:05:21,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:21,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:21,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 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 119 states. [2022-04-28 10:05:21,787 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 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 119 states. [2022-04-28 10:05:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:21,788 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2022-04-28 10:05:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-04-28 10:05:21,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:21,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:21,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:21,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2022-04-28 10:05:21,790 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 32 [2022-04-28 10:05:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:21,790 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2022-04-28 10:05:21,790 INFO L496 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-28 10:05:21,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 140 transitions. [2022-04-28 10:05:22,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-28 10:05:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:05:22,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:22,010 INFO L195 NwaCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:22,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 10:05:22,215 WARN L477 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-28 10:05:22,215 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash 237157614, now seen corresponding path program 79 times [2022-04-28 10:05:22,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:22,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804275057] [2022-04-28 10:05:22,218 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:22,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 237157614, now seen corresponding path program 80 times [2022-04-28 10:05:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:22,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568479725] [2022-04-28 10:05:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {28013#(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); {27990#true} is VALID [2022-04-28 10:05:22,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-28 10:05:22,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-28 10:05:22,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {28013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:22,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {28013#(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); {27990#true} is VALID [2022-04-28 10:05:22,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-28 10:05:22,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-28 10:05:22,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-28 10:05:22,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27995#(= main_~y~0 0)} is VALID [2022-04-28 10:05:22,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {27995#(= 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; {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:22,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {27996#(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; {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:22,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {27997#(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; {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:22,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {27998#(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; {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:22,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {27999#(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; {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:22,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {28000#(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; {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:22,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {28001#(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; {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:22,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {28002#(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; {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:22,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {28003#(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; {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:22,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {28004#(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; {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:22,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {28005#(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; {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:22,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {28006#(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; {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:22,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {28007#(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; {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:22,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {28008#(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; {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:22,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {28009#(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; {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:22,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:22,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:05:22,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#(and (<= main_~z~0 15) (<= 15 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; {28012#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:22,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {28012#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-28 10:05:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:22,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568479725] [2022-04-28 10:05:22,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568479725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432486810] [2022-04-28 10:05:22,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:22,532 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-28 10:05:22,554 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-28 10:05:22,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:22,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:22,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:05:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:22,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:22,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {27990#true} is VALID [2022-04-28 10:05:22,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#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); {27990#true} is VALID [2022-04-28 10:05:22,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-28 10:05:22,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-28 10:05:22,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-28 10:05:22,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27995#(= main_~y~0 0)} is VALID [2022-04-28 10:05:22,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {27995#(= 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; {27996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:22,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {27996#(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; {27997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:22,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {27997#(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; {27998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:22,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {27998#(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; {27999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:22,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {27999#(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; {28000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:22,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {28000#(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; {28001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:22,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {28001#(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; {28002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:22,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {28002#(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; {28003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:22,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {28003#(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; {28004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:22,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {28004#(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; {28005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:22,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {28005#(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; {28006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:22,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {28006#(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; {28007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:22,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {28007#(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; {28008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:22,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {28008#(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; {28009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:22,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {28009#(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; {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:22,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:22,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {28010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {28011#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {28011#(and (<= main_~z~0 15) (<= 15 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; {28086#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {28086#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:22,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-28 10:05:22,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-28 10:05:22,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-28 10:05:22,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-28 10:05:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:22,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:23,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {27991#false} assume !false; {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {27991#false} assume 0 == ~cond; {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {27991#false} ~cond := #in~cond; {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L272 TraceCheckUtils]: 28: Hoare triple {27991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {27991#false} assume !(~y~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {27991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {27991#false} is VALID [2022-04-28 10:05:23,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {28132#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27991#false} is VALID [2022-04-28 10:05:23,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {28136#(< 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; {28132#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:23,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {28136#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:23,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:23,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {28147#(< 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; {28140#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:23,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {28151#(< 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; {28147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:23,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {28155#(< 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; {28151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:23,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {28159#(< 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; {28155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:23,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {28163#(< 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; {28159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:23,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {28167#(< 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; {28163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:23,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {28171#(< 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; {28167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:23,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {28175#(< 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; {28171#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:23,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {28179#(< 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; {28175#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:23,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {28183#(< 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; {28179#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:05:23,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {28187#(< 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; {28183#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:05:23,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {28191#(< 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; {28187#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:05:23,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {28195#(< 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; {28191#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:05:23,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {28199#(< 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; {28195#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:05:23,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {28203#(< 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; {28199#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:05:23,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {27990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28203#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:05:23,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {27990#true} call #t~ret11 := main(); {27990#true} is VALID [2022-04-28 10:05:23,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27990#true} {27990#true} #61#return; {27990#true} is VALID [2022-04-28 10:05:23,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {27990#true} assume true; {27990#true} is VALID [2022-04-28 10:05:23,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {27990#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); {27990#true} is VALID [2022-04-28 10:05:23,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {27990#true} call ULTIMATE.init(); {27990#true} is VALID [2022-04-28 10:05:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:23,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432486810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:23,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:23,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:05:23,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:23,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804275057] [2022-04-28 10:05:23,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804275057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:23,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:23,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:05:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982544852] [2022-04-28 10:05:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:23,548 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 32 [2022-04-28 10:05:23,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:23,548 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-28 10:05:23,574 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-28 10:05:23,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:05:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:05:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:05:23,576 INFO L87 Difference]: Start difference. First operand 109 states and 140 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-28 10:05:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:26,058 INFO L93 Difference]: Finished difference Result 169 states and 238 transitions. [2022-04-28 10:05:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:05:26,058 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 32 [2022-04-28 10:05:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:26,058 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-28 10:05:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2022-04-28 10:05:26,059 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-28 10:05:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 115 transitions. [2022-04-28 10:05:26,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 115 transitions. [2022-04-28 10:05:26,160 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-28 10:05:26,161 INFO L225 Difference]: With dead ends: 169 [2022-04-28 10:05:26,161 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 10:05:26,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=731, Invalid=2691, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:05:26,162 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:26,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 130 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:05:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 10:05:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 115. [2022-04-28 10:05:26,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:26,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:26,461 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:26,462 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:26,463 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-28 10:05:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-28 10:05:26,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:26,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:26,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:05:26,464 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:05:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:26,465 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-28 10:05:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-28 10:05:26,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:26,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:26,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:26,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2022-04-28 10:05:26,467 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 32 [2022-04-28 10:05:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:26,467 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2022-04-28 10:05:26,467 INFO L496 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-28 10:05:26,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 148 transitions. [2022-04-28 10:05:26,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-28 10:05:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:05:26,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:26,692 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:26,710 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-28 10:05:26,893 WARN L477 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-28 10:05:26,893 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1766095279, now seen corresponding path program 81 times [2022-04-28 10:05:26,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:26,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426752690] [2022-04-28 10:05:26,896 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:26,896 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1766095279, now seen corresponding path program 82 times [2022-04-28 10:05:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:26,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346975505] [2022-04-28 10:05:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {29171#(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); {29152#true} is VALID [2022-04-28 10:05:27,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-28 10:05:27,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-28 10:05:27,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:27,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {29171#(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); {29152#true} is VALID [2022-04-28 10:05:27,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-28 10:05:27,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-28 10:05:27,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-28 10:05:27,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29157#(= main_~y~0 0)} is VALID [2022-04-28 10:05:27,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {29157#(= 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; {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:27,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {29158#(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; {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:27,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {29159#(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; {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:27,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {29160#(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; {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:27,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {29161#(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; {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {29162#(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; {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {29164#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:27,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {29164#(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; {29165#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:27,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {29165#(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; {29166#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:27,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {29166#(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; {29167#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:27,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {29167#(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; {29168#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:27,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {29168#(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; {29169#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:05:27,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {29169#(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; {29170#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:05:27,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {29170#(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; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {29153#false} assume !(~z~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {29153#false} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-28 10:05:27,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-28 10:05:27,149 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-28 10:05:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:27,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346975505] [2022-04-28 10:05:27,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346975505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:27,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126947760] [2022-04-28 10:05:27,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:27,150 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-28 10:05:27,174 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-28 10:05:27,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:27,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:27,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:05:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:27,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29152#true} is VALID [2022-04-28 10:05:27,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#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); {29152#true} is VALID [2022-04-28 10:05:27,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-28 10:05:27,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-28 10:05:27,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-28 10:05:27,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29157#(= main_~y~0 0)} is VALID [2022-04-28 10:05:27,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {29157#(= 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; {29158#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:27,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {29158#(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; {29159#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:27,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {29159#(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; {29160#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:27,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {29160#(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; {29161#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:27,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {29161#(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; {29162#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {29162#(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; {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {29214#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {29214#(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; {29218#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:27,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {29218#(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; {29222#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {29222#(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; {29226#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {29226#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 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; {29230#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {29230#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ 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; {29234#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {29234#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ 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; {29238#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {29238#(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; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {29153#false} assume !(~z~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {29153#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {29153#false} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-28 10:05:27,564 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-28 10:05:27,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-28 10:05:27,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-28 10:05:27,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-28 10:05:27,565 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-28 10:05:27,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:28,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {29153#false} assume !false; {29153#false} is VALID [2022-04-28 10:05:28,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {29153#false} assume 0 == ~cond; {29153#false} is VALID [2022-04-28 10:05:28,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {29153#false} ~cond := #in~cond; {29153#false} is VALID [2022-04-28 10:05:28,109 INFO L272 TraceCheckUtils]: 29: Hoare triple {29153#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29153#false} is VALID [2022-04-28 10:05:28,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {29290#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29153#false} is VALID [2022-04-28 10:05:28,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {29294#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29290#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:28,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {29298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29294#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:28,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {29302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:28,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {29306#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:28,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {29310#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29306#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:28,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {29310#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:28,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:28,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {29321#(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; {29314#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:28,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {29325#(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; {29321#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:28,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {29329#(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; {29325#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:28,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {29333#(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; {29329#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:28,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {29337#(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; {29333#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:28,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {29341#(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; {29337#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {29345#(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; {29341#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {29152#true} ~z~0 := ~y~0; {29345#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {29152#true} assume !(~x~0 % 4294967296 > 0); {29152#true} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {29152#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; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {29152#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {29152#true} call #t~ret11 := main(); {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29152#true} {29152#true} #61#return; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {29152#true} assume true; {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {29152#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); {29152#true} is VALID [2022-04-28 10:05:28,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {29152#true} call ULTIMATE.init(); {29152#true} is VALID [2022-04-28 10:05:28,123 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-28 10:05:28,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126947760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:28,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:28,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-28 10:05:28,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:28,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426752690] [2022-04-28 10:05:28,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426752690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:28,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:28,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567236123] [2022-04-28 10:05:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:28,124 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:28,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:28,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:28,144 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-28 10:05:28,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:05:28,145 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,095 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2022-04-28 10:05:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:05:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-28 10:05:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2022-04-28 10:05:29,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 41 transitions. [2022-04-28 10:05:29,125 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-28 10:05:29,126 INFO L225 Difference]: With dead ends: 127 [2022-04-28 10:05:29,127 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 10:05:29,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=444, Invalid=2208, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:05:29,127 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:29,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 10:05:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 10:05:29,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:29,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:29,388 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:29,388 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,389 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-28 10:05:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 10:05:29,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:29,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:29,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 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 106 states. [2022-04-28 10:05:29,390 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 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 106 states. [2022-04-28 10:05:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:29,391 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-28 10:05:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 10:05:29,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:29,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:29,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:29,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-28 10:05:29,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 33 [2022-04-28 10:05:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:29,393 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-28 10:05:29,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 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-28 10:05:29,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-28 10:05:29,620 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-28 10:05:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 10:05:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:05:29,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:29,621 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:29,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-28 10:05:29,821 WARN L477 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-28 10:05:29,822 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 83 times [2022-04-28 10:05:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:29,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950537972] [2022-04-28 10:05:29,824 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:29,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 84 times [2022-04-28 10:05:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:29,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677387684] [2022-04-28 10:05:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:29,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {30115#(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); {30096#true} is VALID [2022-04-28 10:05:30,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-28 10:05:30,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-28 10:05:30,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:30,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {30115#(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); {30096#true} is VALID [2022-04-28 10:05:30,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-28 10:05:30,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-28 10:05:30,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-28 10:05:30,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30101#(= main_~y~0 0)} is VALID [2022-04-28 10:05:30,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {30101#(= 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; {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:30,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {30102#(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; {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:30,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {30103#(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; {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:30,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {30104#(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; {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:30,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(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; {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:30,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(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; {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:30,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {30107#(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; {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {30109#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:30,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {30109#(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; {30110#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:30,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {30110#(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; {30111#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:30,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {30111#(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; {30112#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:30,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {30112#(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; {30113#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:30,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {30113#(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; {30114#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {30114#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-28 10:05:30,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-28 10:05:30,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-28 10:05:30,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-28 10:05:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:30,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677387684] [2022-04-28 10:05:30,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677387684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907620905] [2022-04-28 10:05:30,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:30,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:30,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:30,076 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-28 10:05:30,077 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-28 10:05:30,285 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:05:30,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:30,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:05:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:30,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:30,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30096#true} is VALID [2022-04-28 10:05:30,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#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); {30096#true} is VALID [2022-04-28 10:05:30,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-28 10:05:30,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-28 10:05:30,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-28 10:05:30,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30101#(= main_~y~0 0)} is VALID [2022-04-28 10:05:30,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {30101#(= 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; {30102#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:30,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {30102#(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; {30103#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:30,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {30103#(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; {30104#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:30,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {30104#(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; {30105#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:30,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {30105#(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; {30106#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:30,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {30106#(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; {30107#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:30,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {30107#(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; {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {30108#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {30161#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {30161#(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; {30165#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:30,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {30165#(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; {30169#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {30169#(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; {30173#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {30173#(and (= (+ (- 2) main_~y~0) (+ 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; {30177#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:05:30,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {30177#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30181#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {30181#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-28 10:05:30,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-28 10:05:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:30,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {30097#false} assume !false; {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {30097#false} assume 0 == ~cond; {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {30097#false} ~cond := #in~cond; {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L272 TraceCheckUtils]: 29: Hoare triple {30097#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {30097#false} assume !(~y~0 % 4294967296 > 0); {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {30097#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {30239#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30097#false} is VALID [2022-04-28 10:05:30,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {30243#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30239#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:30,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {30247#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30243#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:30,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {30251#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30247#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:30,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {30255#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30251#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:30,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {30259#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {30255#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:30,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {30263#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30259#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:30,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {30267#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {30263#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:05:30,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {30271#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {30267#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:30,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {30275#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {30271#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:30,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {30279#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {30275#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {30283#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {30279#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {30096#true} ~z~0 := ~y~0; {30283#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {30096#true} assume !(~x~0 % 4294967296 > 0); {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {30096#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; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {30096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30096#true} is VALID [2022-04-28 10:05:30,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {30096#true} call #t~ret11 := main(); {30096#true} is VALID [2022-04-28 10:05:30,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30096#true} {30096#true} #61#return; {30096#true} is VALID [2022-04-28 10:05:30,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {30096#true} assume true; {30096#true} is VALID [2022-04-28 10:05:30,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {30096#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); {30096#true} is VALID [2022-04-28 10:05:30,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {30096#true} call ULTIMATE.init(); {30096#true} is VALID [2022-04-28 10:05:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:05:30,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907620905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:30,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:30,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 35 [2022-04-28 10:05:30,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:30,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950537972] [2022-04-28 10:05:30,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950537972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:30,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:30,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:30,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549742884] [2022-04-28 10:05:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:30,989 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 33 [2022-04-28 10:05:30,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:30,989 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-28 10:05:31,006 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-28 10:05:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:05:31,007 INFO L87 Difference]: Start difference. First operand 106 states and 137 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-28 10:05:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:32,115 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-28 10:05:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:05:32,116 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 33 [2022-04-28 10:05:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:32,116 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-28 10:05:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 10:05:32,116 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-28 10:05:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 10:05:32,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-28 10:05:32,168 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-28 10:05:32,169 INFO L225 Difference]: With dead ends: 129 [2022-04-28 10:05:32,169 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 10:05:32,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:05:32,170 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:32,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:05:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 10:05:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-04-28 10:05:32,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:32,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:32,449 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:32,449 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:32,450 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-28 10:05:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-28 10:05:32,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:32,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:32,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 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 116 states. [2022-04-28 10:05:32,450 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 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 116 states. [2022-04-28 10:05:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:32,451 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-28 10:05:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-28 10:05:32,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:32,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:32,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:32,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2022-04-28 10:05:32,453 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 33 [2022-04-28 10:05:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:32,453 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2022-04-28 10:05:32,453 INFO L496 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-28 10:05:32,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 138 transitions. [2022-04-28 10:05:32,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2022-04-28 10:05:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:05:32,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:32,668 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:32,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 10:05:32,869 WARN L477 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-28 10:05:32,869 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 85 times [2022-04-28 10:05:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:32,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329931786] [2022-04-28 10:05:32,872 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:32,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 86 times [2022-04-28 10:05:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:32,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692983471] [2022-04-28 10:05:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {31081#(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); {31063#true} is VALID [2022-04-28 10:05:33,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-28 10:05:33,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-28 10:05:33,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:33,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {31081#(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); {31063#true} is VALID [2022-04-28 10:05:33,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-28 10:05:33,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-28 10:05:33,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-28 10:05:33,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31068#(= main_~y~0 0)} is VALID [2022-04-28 10:05:33,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {31068#(= 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; {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:33,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {31069#(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; {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:33,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {31070#(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; {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:33,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {31071#(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; {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:33,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {31072#(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; {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:33,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {31073#(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; {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:33,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {31074#(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; {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:33,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {31075#(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; {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:33,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {31077#(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; {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:33,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {31078#(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; {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:33,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {31079#(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; {31080#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {31080#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-28 10:05:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:33,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692983471] [2022-04-28 10:05:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692983471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908007539] [2022-04-28 10:05:33,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:33,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:33,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:33,071 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-28 10:05:33,071 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-28 10:05:33,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:33,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:33,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:05:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:33,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31063#true} is VALID [2022-04-28 10:05:33,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#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); {31063#true} is VALID [2022-04-28 10:05:33,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-28 10:05:33,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-28 10:05:33,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-28 10:05:33,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31068#(= main_~y~0 0)} is VALID [2022-04-28 10:05:33,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {31068#(= 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; {31069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:33,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {31069#(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; {31070#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:33,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {31070#(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; {31071#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:33,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {31071#(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; {31072#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:33,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {31072#(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; {31073#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:33,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {31073#(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; {31074#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:33,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {31074#(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; {31075#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:33,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {31075#(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; {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {31076#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:33,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {31077#(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; {31078#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:33,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {31078#(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; {31079#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:33,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {31079#(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; {31139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {31139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-28 10:05:33,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-28 10:05:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:33,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:33,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {31064#false} assume !false; {31064#false} is VALID [2022-04-28 10:05:33,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {31064#false} assume 0 == ~cond; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {31064#false} ~cond := #in~cond; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L272 TraceCheckUtils]: 29: Hoare triple {31064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {31064#false} assume !(~y~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {31064#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {31064#false} is VALID [2022-04-28 10:05:33,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {31221#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31064#false} is VALID [2022-04-28 10:05:33,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {31225#(< 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; {31221#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:33,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {31229#(< 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; {31225#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:33,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {31233#(< 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; {31229#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:33,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {31233#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:33,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:33,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {31244#(< 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; {31237#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:33,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {31248#(< 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; {31244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:33,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {31252#(< 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; {31248#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:33,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {31256#(< 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; {31252#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:33,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {31260#(< 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; {31256#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:33,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {31264#(< 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; {31260#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:33,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {31268#(< 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; {31264#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:33,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {31272#(< 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; {31268#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:33,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {31063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31272#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:33,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {31063#true} call #t~ret11 := main(); {31063#true} is VALID [2022-04-28 10:05:33,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31063#true} {31063#true} #61#return; {31063#true} is VALID [2022-04-28 10:05:33,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {31063#true} assume true; {31063#true} is VALID [2022-04-28 10:05:33,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {31063#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); {31063#true} is VALID [2022-04-28 10:05:33,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {31063#true} call ULTIMATE.init(); {31063#true} is VALID [2022-04-28 10:05:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:33,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908007539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:33,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:33,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:05:33,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:33,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329931786] [2022-04-28 10:05:33,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329931786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:33,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:33,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:05:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321390347] [2022-04-28 10:05:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:33,756 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 33 [2022-04-28 10:05:33,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:33,756 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-28 10:05:33,773 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-28 10:05:33,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:05:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:33,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:05:33,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:05:33,774 INFO L87 Difference]: Start difference. First operand 107 states and 138 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-28 10:05:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:34,987 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2022-04-28 10:05:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:05:34,987 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 33 [2022-04-28 10:05:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:34,987 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-28 10:05:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 10:05:34,988 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-28 10:05:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 10:05:34,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-28 10:05:35,037 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-28 10:05:35,038 INFO L225 Difference]: With dead ends: 132 [2022-04-28 10:05:35,038 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 10:05:35,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1656, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:05:35,039 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:35,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 10:05:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2022-04-28 10:05:35,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:35,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:35,300 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:35,301 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:35,302 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-28 10:05:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-28 10:05:35,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:35,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:35,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 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 118 states. [2022-04-28 10:05:35,303 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 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 118 states. [2022-04-28 10:05:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:35,304 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2022-04-28 10:05:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2022-04-28 10:05:35,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:35,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:35,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:35,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-28 10:05:35,306 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 33 [2022-04-28 10:05:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:35,306 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-28 10:05:35,306 INFO L496 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-28 10:05:35,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 139 transitions. [2022-04-28 10:05:35,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-28 10:05:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:05:35,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:35,580 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:35,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:35,780 WARN L477 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-28 10:05:35,781 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1781599729, now seen corresponding path program 87 times [2022-04-28 10:05:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075161275] [2022-04-28 10:05:35,784 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:35,784 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1781599729, now seen corresponding path program 88 times [2022-04-28 10:05:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:35,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255859923] [2022-04-28 10:05:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:36,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:36,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {32065#(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); {32041#true} is VALID [2022-04-28 10:05:36,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-28 10:05:36,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-28 10:05:36,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:36,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {32065#(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); {32041#true} is VALID [2022-04-28 10:05:36,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-28 10:05:36,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-28 10:05:36,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-28 10:05:36,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32046#(= main_~y~0 0)} is VALID [2022-04-28 10:05:36,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {32046#(= 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; {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:36,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {32047#(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; {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:36,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {32048#(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; {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:36,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {32049#(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; {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:36,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {32050#(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; {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:36,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {32051#(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; {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:36,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {32052#(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; {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:36,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {32053#(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; {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:36,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {32054#(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; {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:36,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {32055#(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; {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:36,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {32056#(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; {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:36,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {32057#(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; {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:36,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {32058#(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; {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:36,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {32059#(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; {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:36,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {32060#(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; {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:36,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {32061#(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; {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:05:36,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:05:36,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32064#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {32064#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:36,160 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-28 10:05:36,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-28 10:05:36,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-28 10:05:36,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-28 10:05:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:36,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255859923] [2022-04-28 10:05:36,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255859923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:36,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42464073] [2022-04-28 10:05:36,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:36,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:36,162 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-28 10:05:36,164 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-28 10:05:36,217 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:36,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:36,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:05:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:36,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:36,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32041#true} is VALID [2022-04-28 10:05:36,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#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); {32041#true} is VALID [2022-04-28 10:05:36,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-28 10:05:36,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-28 10:05:36,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-28 10:05:36,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32046#(= main_~y~0 0)} is VALID [2022-04-28 10:05:36,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {32046#(= 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; {32047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:36,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {32047#(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; {32048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:36,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {32048#(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; {32049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:36,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {32049#(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; {32050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:36,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {32050#(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; {32051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:36,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {32051#(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; {32052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:36,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {32052#(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; {32053#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:36,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {32053#(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; {32054#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:36,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {32054#(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; {32055#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:36,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {32055#(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; {32056#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:36,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {32056#(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; {32057#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:36,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {32057#(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; {32058#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:36,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {32058#(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; {32059#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:36,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {32059#(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; {32060#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:36,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {32060#(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; {32061#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:36,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {32061#(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; {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:05:36,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:05:36,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {32062#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:05:36,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {32063#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32141#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:05:36,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {32141#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-28 10:05:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:36,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:37,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {32042#false} assume !false; {32042#false} is VALID [2022-04-28 10:05:37,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {32042#false} assume 0 == ~cond; {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {32042#false} ~cond := #in~cond; {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L272 TraceCheckUtils]: 29: Hoare triple {32042#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {32042#false} assume !(~y~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {32042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {32042#false} is VALID [2022-04-28 10:05:37,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {32187#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32042#false} is VALID [2022-04-28 10:05:37,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {32191#(< 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; {32187#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:37,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32191#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:37,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:37,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {32202#(< 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; {32195#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:37,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {32206#(< 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; {32202#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:37,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {32210#(< 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; {32206#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:37,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {32214#(< 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; {32210#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:37,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {32218#(< 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; {32214#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:37,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {32222#(< 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; {32218#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:37,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {32226#(< 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; {32222#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:37,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {32230#(< 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; {32226#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:37,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {32234#(< 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; {32230#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:37,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {32238#(< 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; {32234#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:05:37,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {32242#(< 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; {32238#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:05:37,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {32246#(< 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; {32242#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:05:37,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {32250#(< 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; {32246#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:05:37,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {32254#(< 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; {32250#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:05:37,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {32258#(< 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; {32254#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:05:37,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {32262#(< 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; {32258#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:05:37,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {32041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32262#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:05:37,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {32041#true} call #t~ret11 := main(); {32041#true} is VALID [2022-04-28 10:05:37,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32041#true} {32041#true} #61#return; {32041#true} is VALID [2022-04-28 10:05:37,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {32041#true} assume true; {32041#true} is VALID [2022-04-28 10:05:37,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {32041#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); {32041#true} is VALID [2022-04-28 10:05:37,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {32041#true} call ULTIMATE.init(); {32041#true} is VALID [2022-04-28 10:05:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:37,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42464073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:37,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:05:37,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:37,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075161275] [2022-04-28 10:05:37,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075161275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:37,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:05:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126068349] [2022-04-28 10:05:37,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:37,276 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 33 [2022-04-28 10:05:37,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:37,276 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-28 10:05:37,296 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-28 10:05:37,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:05:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:05:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:05:37,297 INFO L87 Difference]: Start difference. First operand 108 states and 139 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-28 10:05:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:39,902 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2022-04-28 10:05:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:05:39,902 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 33 [2022-04-28 10:05:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:39,902 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-28 10:05:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-28 10:05:39,903 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-28 10:05:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 118 transitions. [2022-04-28 10:05:39,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 118 transitions. [2022-04-28 10:05:40,004 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-28 10:05:40,006 INFO L225 Difference]: With dead ends: 169 [2022-04-28 10:05:40,006 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 10:05:40,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:05:40,007 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:40,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 130 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:05:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 10:05:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 114. [2022-04-28 10:05:40,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:40,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:40,302 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:40,302 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:40,304 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-28 10:05:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-28 10:05:40,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:40,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:40,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:05:40,305 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:05:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:40,307 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2022-04-28 10:05:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2022-04-28 10:05:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:40,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:40,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2022-04-28 10:05:40,309 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 33 [2022-04-28 10:05:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:40,309 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2022-04-28 10:05:40,310 INFO L496 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-28 10:05:40,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 147 transitions. [2022-04-28 10:05:40,543 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-28 10:05:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2022-04-28 10:05:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:05:40,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:40,544 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:40,570 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-28 10:05:40,757 WARN L477 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-28 10:05:40,757 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 89 times [2022-04-28 10:05:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837054529] [2022-04-28 10:05:40,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:40,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 90 times [2022-04-28 10:05:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:40,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851767945] [2022-04-28 10:05:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {33231#(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); {33211#true} is VALID [2022-04-28 10:05:41,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-28 10:05:41,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-28 10:05:41,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:41,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {33231#(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); {33211#true} is VALID [2022-04-28 10:05:41,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-28 10:05:41,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-28 10:05:41,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-28 10:05:41,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33216#(= main_~y~0 0)} is VALID [2022-04-28 10:05:41,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {33216#(= 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; {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:41,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {33217#(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; {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:41,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {33218#(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; {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:41,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {33219#(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; {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:41,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {33220#(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; {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:41,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {33221#(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; {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {33222#(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; {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {33224#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:41,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {33224#(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; {33225#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:41,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {33225#(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; {33226#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:41,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {33226#(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; {33227#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:41,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {33227#(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; {33228#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:41,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {33228#(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; {33229#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:41,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {33229#(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; {33230#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {33230#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-28 10:05:41,028 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-28 10:05:41,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-28 10:05:41,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-28 10:05:41,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-28 10:05:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:41,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851767945] [2022-04-28 10:05:41,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851767945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:41,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287239227] [2022-04-28 10:05:41,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:41,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:41,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:41,032 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-28 10:05:41,055 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-28 10:05:41,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:05:41,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:41,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:05:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:41,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33211#true} is VALID [2022-04-28 10:05:41,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#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); {33211#true} is VALID [2022-04-28 10:05:41,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-28 10:05:41,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-28 10:05:41,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-28 10:05:41,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33216#(= main_~y~0 0)} is VALID [2022-04-28 10:05:41,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {33216#(= 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; {33217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:41,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {33217#(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; {33218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:41,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {33218#(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; {33219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:41,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {33219#(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; {33220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:41,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {33220#(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; {33221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:41,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {33221#(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; {33222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {33222#(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; {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {33223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {33277#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {33277#(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; {33281#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:41,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {33281#(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; {33285#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:05:41,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {33285#(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; {33289#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {33289#(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; {33293#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:41,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {33293#(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; {33297#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {33297#(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; {33301#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {33301#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {33212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-28 10:05:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:41,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:41,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {33212#false} assume !false; {33212#false} is VALID [2022-04-28 10:05:41,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {33212#false} assume 0 == ~cond; {33212#false} is VALID [2022-04-28 10:05:41,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {33212#false} ~cond := #in~cond; {33212#false} is VALID [2022-04-28 10:05:41,920 INFO L272 TraceCheckUtils]: 30: Hoare triple {33212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33212#false} is VALID [2022-04-28 10:05:41,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {33212#false} assume !(~y~0 % 4294967296 > 0); {33212#false} is VALID [2022-04-28 10:05:41,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {33356#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33212#false} is VALID [2022-04-28 10:05:41,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {33360#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33356#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:41,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {33364#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33360#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:41,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {33368#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33364#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:41,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {33372#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33368#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:41,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {33376#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33372#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:41,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {33380#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {33376#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:41,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {33384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33380#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:41,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {33388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 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; {33384#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {33392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {33388#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {33396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 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; {33392#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {33400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 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; {33396#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {33404#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 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; {33400#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {33408#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 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; {33404#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {33211#true} ~z~0 := ~y~0; {33408#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {33211#true} assume !(~x~0 % 4294967296 > 0); {33211#true} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {33211#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; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {33211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {33211#true} call #t~ret11 := main(); {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33211#true} {33211#true} #61#return; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {33211#true} assume true; {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {33211#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); {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {33211#true} call ULTIMATE.init(); {33211#true} is VALID [2022-04-28 10:05:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:05:41,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287239227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:41,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:41,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 39 [2022-04-28 10:05:41,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837054529] [2022-04-28 10:05:41,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837054529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:41,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:41,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244887617] [2022-04-28 10:05:41,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:41,931 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 34 [2022-04-28 10:05:41,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:41,931 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-28 10:05:41,949 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-28 10:05:41,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:05:41,950 INFO L87 Difference]: Start difference. First operand 114 states and 147 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-28 10:05:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:43,236 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2022-04-28 10:05:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:43,236 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 34 [2022-04-28 10:05:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:43,237 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-28 10:05:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-28 10:05:43,237 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-28 10:05:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-28 10:05:43,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2022-04-28 10:05:43,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:43,278 INFO L225 Difference]: With dead ends: 137 [2022-04-28 10:05:43,278 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 10:05:43,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:05:43,278 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:43,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 10:05:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-04-28 10:05:43,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:43,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:43,563 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:43,563 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:43,564 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-28 10:05:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-28 10:05:43,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:43,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:43,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 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 124 states. [2022-04-28 10:05:43,564 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 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 124 states. [2022-04-28 10:05:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:43,565 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-28 10:05:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-28 10:05:43,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:43,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:43,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:43,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2022-04-28 10:05:43,567 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 34 [2022-04-28 10:05:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:43,567 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2022-04-28 10:05:43,567 INFO L496 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-28 10:05:43,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 148 transitions. [2022-04-28 10:05:43,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-04-28 10:05:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:05:43,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:43,802 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:43,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 10:05:44,002 WARN L477 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-28 10:05:44,003 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 91 times [2022-04-28 10:05:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112383520] [2022-04-28 10:05:44,005 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:44,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 92 times [2022-04-28 10:05:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:44,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640303893] [2022-04-28 10:05:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {34257#(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); {34238#true} is VALID [2022-04-28 10:05:44,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-28 10:05:44,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-28 10:05:44,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:44,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {34257#(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); {34238#true} is VALID [2022-04-28 10:05:44,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-28 10:05:44,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-28 10:05:44,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-28 10:05:44,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34243#(= main_~y~0 0)} is VALID [2022-04-28 10:05:44,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {34243#(= 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; {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:44,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {34244#(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; {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:44,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {34245#(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; {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:44,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {34246#(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; {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:44,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {34247#(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; {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:44,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {34248#(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; {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:44,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {34249#(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; {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:44,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {34250#(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; {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:44,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {34252#(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; {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:44,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {34253#(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; {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:44,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {34254#(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; {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {34255#(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; {34256#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {34256#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-28 10:05:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640303893] [2022-04-28 10:05:44,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640303893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:44,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118090450] [2022-04-28 10:05:44,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:44,252 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-28 10:05:44,253 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-28 10:05:44,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:44,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:44,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:05:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:44,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34238#true} is VALID [2022-04-28 10:05:44,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#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); {34238#true} is VALID [2022-04-28 10:05:44,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-28 10:05:44,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-28 10:05:44,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-28 10:05:44,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34243#(= main_~y~0 0)} is VALID [2022-04-28 10:05:44,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {34243#(= 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; {34244#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:44,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {34244#(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; {34245#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:44,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {34245#(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; {34246#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:44,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {34246#(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; {34247#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:44,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {34247#(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; {34248#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:44,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {34248#(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; {34249#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:44,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {34249#(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; {34250#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:44,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {34250#(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; {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {34251#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {34252#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:44,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {34252#(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; {34253#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:44,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {34253#(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; {34254#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:44,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {34254#(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; {34255#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:44,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {34255#(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; {34318#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:44,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {34318#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:44,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-28 10:05:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:44,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:45,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {34239#false} assume !false; {34239#false} is VALID [2022-04-28 10:05:45,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {34239#false} assume 0 == ~cond; {34239#false} is VALID [2022-04-28 10:05:45,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {34239#false} ~cond := #in~cond; {34239#false} is VALID [2022-04-28 10:05:45,054 INFO L272 TraceCheckUtils]: 30: Hoare triple {34239#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {34239#false} assume !(~y~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {34239#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {34239#false} is VALID [2022-04-28 10:05:45,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {34400#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34239#false} is VALID [2022-04-28 10:05:45,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {34404#(< 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; {34400#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:45,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {34408#(< 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; {34404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:45,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {34412#(< 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; {34408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:45,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {34416#(< 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; {34412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:45,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {34416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:05:45,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:45,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {34427#(< 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; {34420#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:45,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {34431#(< 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; {34427#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:05:45,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {34435#(< 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; {34431#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:45,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {34439#(< 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; {34435#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:45,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {34443#(< 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; {34439#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:45,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {34447#(< 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; {34443#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:45,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {34451#(< 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; {34447#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:45,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {34455#(< 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; {34451#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:45,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {34238#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34455#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:45,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {34238#true} call #t~ret11 := main(); {34238#true} is VALID [2022-04-28 10:05:45,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34238#true} {34238#true} #61#return; {34238#true} is VALID [2022-04-28 10:05:45,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {34238#true} assume true; {34238#true} is VALID [2022-04-28 10:05:45,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {34238#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); {34238#true} is VALID [2022-04-28 10:05:45,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {34238#true} call ULTIMATE.init(); {34238#true} is VALID [2022-04-28 10:05:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:45,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118090450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:45,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:45,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:05:45,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112383520] [2022-04-28 10:05:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112383520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:45,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106208930] [2022-04-28 10:05:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:45,068 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 34 [2022-04-28 10:05:45,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:45,069 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-28 10:05:45,090 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-28 10:05:45,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:45,091 INFO L87 Difference]: Start difference. First operand 115 states and 148 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-28 10:05:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,445 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2022-04-28 10:05:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:05:46,445 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 34 [2022-04-28 10:05:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:46,445 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-28 10:05:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 10:05:46,446 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-28 10:05:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 10:05:46,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-28 10:05:46,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:46,493 INFO L225 Difference]: With dead ends: 140 [2022-04-28 10:05:46,493 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 10:05:46,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:05:46,494 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:46,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 10:05:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2022-04-28 10:05:46,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:46,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:46,888 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:46,888 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,890 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-04-28 10:05:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2022-04-28 10:05:46,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:46,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:46,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 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 126 states. [2022-04-28 10:05:46,890 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 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 126 states. [2022-04-28 10:05:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,891 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-04-28 10:05:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2022-04-28 10:05:46,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:46,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:46,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:46,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-04-28 10:05:46,893 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 34 [2022-04-28 10:05:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:46,893 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-04-28 10:05:46,893 INFO L496 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-28 10:05:46,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 149 transitions. [2022-04-28 10:05:47,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-04-28 10:05:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:05:47,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:47,128 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:47,145 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-28 10:05:47,329 WARN L477 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-28 10:05:47,329 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 93 times [2022-04-28 10:05:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:47,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255341790] [2022-04-28 10:05:47,331 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:47,331 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 94 times [2022-04-28 10:05:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:47,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902002876] [2022-04-28 10:05:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:47,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {35294#(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); {35276#true} is VALID [2022-04-28 10:05:47,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-28 10:05:47,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-28 10:05:47,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:47,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {35294#(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); {35276#true} is VALID [2022-04-28 10:05:47,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-28 10:05:47,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-28 10:05:47,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-28 10:05:47,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35281#(= main_~y~0 0)} is VALID [2022-04-28 10:05:47,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(= 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; {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:47,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {35282#(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; {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:47,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {35283#(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; {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:47,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {35284#(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; {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:47,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {35285#(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; {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:47,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {35286#(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; {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:47,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {35287#(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; {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:47,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {35288#(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; {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:47,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {35289#(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; {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:47,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:47,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:05:47,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {35291#(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; {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:47,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {35292#(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; {35293#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {35293#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-28 10:05:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:05:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:47,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902002876] [2022-04-28 10:05:47,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902002876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:47,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848451099] [2022-04-28 10:05:47,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:47,568 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-28 10:05:47,570 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-28 10:05:47,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:47,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:47,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:05:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:47,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:47,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35276#true} is VALID [2022-04-28 10:05:47,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#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); {35276#true} is VALID [2022-04-28 10:05:47,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-28 10:05:47,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-28 10:05:47,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-28 10:05:47,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35281#(= main_~y~0 0)} is VALID [2022-04-28 10:05:47,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {35281#(= 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; {35282#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:47,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {35282#(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; {35283#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:47,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {35283#(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; {35284#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:47,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {35284#(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; {35285#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:47,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {35285#(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; {35286#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:47,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {35286#(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; {35287#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:47,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {35287#(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; {35288#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:47,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {35288#(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; {35289#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:47,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {35289#(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; {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:47,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:47,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {35290#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {35291#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:05:47,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {35291#(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; {35292#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:47,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {35292#(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; {35352#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {35352#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-28 10:05:47,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-28 10:05:47,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-28 10:05:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:05:47,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:48,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {35277#false} assume !false; {35277#false} is VALID [2022-04-28 10:05:48,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {35277#false} assume 0 == ~cond; {35277#false} is VALID [2022-04-28 10:05:48,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {35277#false} ~cond := #in~cond; {35277#false} is VALID [2022-04-28 10:05:48,263 INFO L272 TraceCheckUtils]: 30: Hoare triple {35277#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35277#false} is VALID [2022-04-28 10:05:48,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {35277#false} assume !(~y~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:48,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {35277#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {35277#false} is VALID [2022-04-28 10:05:48,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {35440#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35277#false} is VALID [2022-04-28 10:05:48,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {35444#(< 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; {35440#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:48,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {35448#(< 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; {35444#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:48,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35448#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:48,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:48,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {35459#(< 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; {35452#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:48,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {35463#(< 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; {35459#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:48,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {35467#(< 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; {35463#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:48,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {35471#(< 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; {35467#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:48,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {35475#(< 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; {35471#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:48,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {35479#(< 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; {35475#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:48,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {35483#(< 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; {35479#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:48,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {35487#(< 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; {35483#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:48,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {35491#(< 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; {35487#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:48,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {35276#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35491#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:48,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {35276#true} call #t~ret11 := main(); {35276#true} is VALID [2022-04-28 10:05:48,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35276#true} {35276#true} #61#return; {35276#true} is VALID [2022-04-28 10:05:48,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {35276#true} assume true; {35276#true} is VALID [2022-04-28 10:05:48,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {35276#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); {35276#true} is VALID [2022-04-28 10:05:48,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {35276#true} call ULTIMATE.init(); {35276#true} is VALID [2022-04-28 10:05:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:05:48,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848451099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:48,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:48,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:05:48,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255341790] [2022-04-28 10:05:48,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255341790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:48,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:48,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:05:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179575353] [2022-04-28 10:05:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:48,275 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 34 [2022-04-28 10:05:48,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:48,275 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-28 10:05:48,291 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-28 10:05:48,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:05:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:48,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:05:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:05:48,292 INFO L87 Difference]: Start difference. First operand 116 states and 149 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-28 10:05:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:49,586 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2022-04-28 10:05:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:05:49,586 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 34 [2022-04-28 10:05:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:49,587 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-28 10:05:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-28 10:05:49,587 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-28 10:05:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-28 10:05:49,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 63 transitions. [2022-04-28 10:05:49,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:49,636 INFO L225 Difference]: With dead ends: 143 [2022-04-28 10:05:49,637 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 10:05:49,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:05:49,637 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:49,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 10:05:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2022-04-28 10:05:49,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:49,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:49,951 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:49,951 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:49,952 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2022-04-28 10:05:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-04-28 10:05:49,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:49,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:49,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 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-28 10:05:49,953 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 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-28 10:05:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:49,954 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2022-04-28 10:05:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-04-28 10:05:49,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:49,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:49,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:49,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2022-04-28 10:05:49,955 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 34 [2022-04-28 10:05:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:49,955 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2022-04-28 10:05:49,955 INFO L496 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-28 10:05:49,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 150 transitions. [2022-04-28 10:05:50,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2022-04-28 10:05:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:05:50,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:50,189 INFO L195 NwaCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:50,205 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-28 10:05:50,390 WARN L477 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-28 10:05:50,390 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:50,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 61432078, now seen corresponding path program 95 times [2022-04-28 10:05:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:50,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1110849404] [2022-04-28 10:05:50,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:50,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 61432078, now seen corresponding path program 96 times [2022-04-28 10:05:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548672744] [2022-04-28 10:05:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:50,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {36345#(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); {36320#true} is VALID [2022-04-28 10:05:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-28 10:05:50,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-28 10:05:50,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:50,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {36345#(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); {36320#true} is VALID [2022-04-28 10:05:50,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-28 10:05:50,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-28 10:05:50,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-28 10:05:50,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36325#(= main_~y~0 0)} is VALID [2022-04-28 10:05:50,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {36325#(= 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; {36326#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:50,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {36326#(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; {36327#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:50,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {36327#(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; {36328#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:50,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {36328#(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; {36329#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:50,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {36329#(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; {36330#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:50,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {36330#(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; {36331#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:50,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {36331#(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; {36332#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:50,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {36332#(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; {36333#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:50,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {36333#(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; {36334#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:50,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {36334#(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; {36335#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:50,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {36335#(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; {36336#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:50,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {36336#(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; {36337#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:50,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {36337#(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; {36338#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:50,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {36338#(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; {36339#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:50,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {36339#(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; {36340#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:05:50,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {36340#(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; {36341#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:05:50,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {36341#(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; {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:05:50,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:05:50,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {36342#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {36343#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:05:50,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {36343#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36344#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {36344#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {36321#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {36321#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-28 10:05:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:05:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:50,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548672744] [2022-04-28 10:05:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548672744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256761312] [2022-04-28 10:05:50,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:50,753 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-28 10:05:50,753 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-28 10:05:50,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:05:50,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:50,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:05:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:50,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:50,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#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); {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {36320#true} assume !(~x~0 % 4294967296 > 0); {36320#true} is VALID [2022-04-28 10:05:50,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {36320#true} ~z~0 := ~y~0; {36421#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:05:50,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {36421#(= 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; {36425#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:05:50,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {36425#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:50,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36433#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:50,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {36433#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-28 10:05:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 10:05:50,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:51,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {36321#false} assume !false; {36321#false} is VALID [2022-04-28 10:05:51,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {36321#false} assume 0 == ~cond; {36321#false} is VALID [2022-04-28 10:05:51,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {36321#false} ~cond := #in~cond; {36321#false} is VALID [2022-04-28 10:05:51,065 INFO L272 TraceCheckUtils]: 30: Hoare triple {36321#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {36321#false} is VALID [2022-04-28 10:05:51,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {36321#false} assume !(~y~0 % 4294967296 > 0); {36321#false} is VALID [2022-04-28 10:05:51,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {36433#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36321#false} is VALID [2022-04-28 10:05:51,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {36433#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:51,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {36473#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {36429#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:51,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {36477#(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; {36473#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {36320#true} ~z~0 := ~y~0; {36477#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {36320#true} assume !(~x~0 % 4294967296 > 0); {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {36320#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; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {36320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {36320#true} call #t~ret11 := main(); {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36320#true} {36320#true} #61#return; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {36320#true} assume true; {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {36320#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); {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {36320#true} call ULTIMATE.init(); {36320#true} is VALID [2022-04-28 10:05:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 10:05:51,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256761312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:51,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:51,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 6, 6] total 29 [2022-04-28 10:05:51,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:51,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1110849404] [2022-04-28 10:05:51,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1110849404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:51,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:51,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:05:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146791352] [2022-04-28 10:05:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:51,076 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 34 [2022-04-28 10:05:51,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:51,076 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-28 10:05:51,096 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-28 10:05:51,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:05:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:05:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:05:51,097 INFO L87 Difference]: Start difference. First operand 117 states and 150 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-28 10:05:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:53,988 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2022-04-28 10:05:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:05:53,988 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 34 [2022-04-28 10:05:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:53,988 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-28 10:05:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2022-04-28 10:05:53,989 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-28 10:05:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2022-04-28 10:05:53,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 125 transitions. [2022-04-28 10:05:54,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:54,092 INFO L225 Difference]: With dead ends: 179 [2022-04-28 10:05:54,092 INFO L226 Difference]: Without dead ends: 171 [2022-04-28 10:05:54,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:05:54,092 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:54,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 138 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:05:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-28 10:05:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2022-04-28 10:05:54,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:54,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:54,409 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:54,409 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:54,410 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-28 10:05:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-28 10:05:54,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:54,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:54,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 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 171 states. [2022-04-28 10:05:54,411 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 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 171 states. [2022-04-28 10:05:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:54,412 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-28 10:05:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-28 10:05:54,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:54,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:54,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:54,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2022-04-28 10:05:54,414 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 34 [2022-04-28 10:05:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:54,414 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2022-04-28 10:05:54,414 INFO L496 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-28 10:05:54,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 158 transitions. [2022-04-28 10:05:54,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2022-04-28 10:05:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:05:54,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:54,664 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:54,679 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-28 10:05:54,864 WARN L477 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-28 10:05:54,864 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 97 times [2022-04-28 10:05:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:54,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377018877] [2022-04-28 10:05:54,867 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:54,867 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 98 times [2022-04-28 10:05:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:54,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841601254] [2022-04-28 10:05:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {37558#(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); {37543#true} is VALID [2022-04-28 10:05:55,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:55,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {37558#(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); {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-28 10:05:55,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= 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; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= 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; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= 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; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= 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; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= 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; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= 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; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= 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; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,072 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:05:55,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {37556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:05:55,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {37557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37544#false} is VALID [2022-04-28 10:05:55,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-28 10:05:55,073 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-28 10:05:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841601254] [2022-04-28 10:05:55,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841601254] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:55,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152110931] [2022-04-28 10:05:55,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:55,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:55,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:55,076 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-28 10:05:55,111 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-28 10:05:55,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:55,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:55,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:05:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:55,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:55,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#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); {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= 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; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= 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; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= 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; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= 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; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= 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; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= 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; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= 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; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,463 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:55,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:55,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {37659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37544#false} is VALID [2022-04-28 10:05:55,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-28 10:05:55,464 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-28 10:05:55,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:55,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {37544#false} assume !false; {37544#false} is VALID [2022-04-28 10:05:55,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {37659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37544#false} is VALID [2022-04-28 10:05:55,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:55,792 INFO L272 TraceCheckUtils]: 31: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:55,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {37554#(<= 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; {37555#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(<= 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; {37554#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {37552#(<= 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; {37553#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:05:55,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {37551#(<= 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; {37552#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {37550#(<= 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; {37551#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {37549#(<= 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; {37550#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:05:55,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {37548#(<= 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; {37549#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:05:55,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {37543#true} assume !(~x~0 % 4294967296 > 0); {37548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:05:55,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {37543#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; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {37543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {37543#true} call #t~ret11 := main(); {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37543#true} {37543#true} #61#return; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {37543#true} assume true; {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {37543#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); {37543#true} is VALID [2022-04-28 10:05:55,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {37543#true} call ULTIMATE.init(); {37543#true} is VALID [2022-04-28 10:05:55,808 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-28 10:05:55,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152110931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:55,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:55,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-28 10:05:55,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:55,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377018877] [2022-04-28 10:05:55,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377018877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:55,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:55,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:05:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388293160] [2022-04-28 10:05:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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 35 [2022-04-28 10:05:55,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:55,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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-28 10:05:55,840 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-28 10:05:55,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:05:55,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:05:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:05:55,841 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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-28 10:05:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:57,918 INFO L93 Difference]: Finished difference Result 314 states and 413 transitions. [2022-04-28 10:05:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:05:57,918 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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 35 [2022-04-28 10:05:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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-28 10:05:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-28 10:05:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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-28 10:05:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-28 10:05:57,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-28 10:05:57,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:57,972 INFO L225 Difference]: With dead ends: 314 [2022-04-28 10:05:57,972 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 10:05:57,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:05:57,973 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:57,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 84 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 10:05:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 127. [2022-04-28 10:05:58,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:58,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:58,323 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:58,323 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:58,326 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2022-04-28 10:05:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2022-04-28 10:05:58,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:58,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:58,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 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 301 states. [2022-04-28 10:05:58,327 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 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 301 states. [2022-04-28 10:05:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:58,332 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2022-04-28 10:05:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2022-04-28 10:05:58,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:58,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:58,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:58,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:05:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2022-04-28 10:05:58,334 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 35 [2022-04-28 10:05:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:58,334 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2022-04-28 10:05:58,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 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-28 10:05:58,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 164 transitions. [2022-04-28 10:05:58,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-28 10:05:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:05:58,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:58,625 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:58,641 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-28 10:05:58,825 WARN L477 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-28 10:05:58,825 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 99 times [2022-04-28 10:05:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:58,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859272196] [2022-04-28 10:05:58,828 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:58,828 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 100 times [2022-04-28 10:05:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916684404] [2022-04-28 10:05:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:59,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {39294#(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); {39274#true} is VALID [2022-04-28 10:05:59,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:59,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {39294#(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); {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-28 10:05:59,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39279#(= main_~y~0 0)} is VALID [2022-04-28 10:05:59,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {39279#(= 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; {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:59,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {39280#(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; {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:59,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {39281#(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; {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:59,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {39282#(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; {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:59,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {39283#(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; {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:59,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {39284#(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; {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:59,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {39285#(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; {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:59,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(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; {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {39288#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:05:59,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {39288#(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; {39289#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:05:59,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {39289#(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; {39290#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:59,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {39290#(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; {39291#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:59,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {39291#(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; {39292#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {39292#(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; {39293#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {39293#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-28 10:05:59,061 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-28 10:05:59,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-28 10:05:59,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-28 10:05:59,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-28 10:05:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916684404] [2022-04-28 10:05:59,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916684404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630415350] [2022-04-28 10:05:59,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:59,064 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-28 10:05:59,065 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-28 10:05:59,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:59,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:59,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:05:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:59,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:59,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39274#true} is VALID [2022-04-28 10:05:59,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#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); {39274#true} is VALID [2022-04-28 10:05:59,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-28 10:05:59,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-28 10:05:59,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-28 10:05:59,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39279#(= main_~y~0 0)} is VALID [2022-04-28 10:05:59,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {39279#(= 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; {39280#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:59,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {39280#(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; {39281#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:59,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {39281#(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; {39282#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:59,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {39282#(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; {39283#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:59,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {39283#(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; {39284#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:59,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {39284#(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; {39285#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:59,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {39285#(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; {39286#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:59,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {39286#(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; {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {39287#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {39343#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {39343#(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; {39347#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:59,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {39347#(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; {39351#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {39351#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 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; {39355#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {39355#(and (= (+ (- 2) main_~y~0) (+ 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; {39359#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {39359#(and (= (+ main_~y~0 (- 3)) (+ 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; {39363#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {39363#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-28 10:05:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:05:59,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:59,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {39275#false} assume !false; {39275#false} is VALID [2022-04-28 10:05:59,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {39275#false} assume 0 == ~cond; {39275#false} is VALID [2022-04-28 10:05:59,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {39275#false} ~cond := #in~cond; {39275#false} is VALID [2022-04-28 10:05:59,796 INFO L272 TraceCheckUtils]: 31: Hoare triple {39275#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {39275#false} is VALID [2022-04-28 10:05:59,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {39275#false} assume !(~y~0 % 4294967296 > 0); {39275#false} is VALID [2022-04-28 10:05:59,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {39275#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {39427#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39275#false} is VALID [2022-04-28 10:05:59,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {39431#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39427#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:59,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {39435#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39431#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:59,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {39439#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39435#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:59,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {39443#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39439#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:59,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {39447#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {39443#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:59,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {39451#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {39447#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:59,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {39455#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {39451#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:05:59,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {39459#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {39455#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:59,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {39463#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 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; {39459#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:59,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {39467#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {39463#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {39471#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 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; {39467#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {39274#true} ~z~0 := ~y~0; {39471#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {39274#true} assume !(~x~0 % 4294967296 > 0); {39274#true} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {39274#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; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {39274#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {39274#true} call #t~ret11 := main(); {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39274#true} {39274#true} #61#return; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {39274#true} assume true; {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {39274#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); {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {39274#true} call ULTIMATE.init(); {39274#true} is VALID [2022-04-28 10:05:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:05:59,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630415350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:59,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:59,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 36 [2022-04-28 10:05:59,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859272196] [2022-04-28 10:05:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859272196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:59,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:59,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676213987] [2022-04-28 10:05:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:59,807 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 35 [2022-04-28 10:05:59,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:59,807 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-28 10:05:59,826 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-28 10:05:59,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:59,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:59,827 INFO L87 Difference]: Start difference. First operand 127 states and 164 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-28 10:06:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:01,450 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2022-04-28 10:06:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:06:01,450 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 35 [2022-04-28 10:06:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:01,450 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-28 10:06:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-28 10:06:01,451 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-28 10:06:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-28 10:06:01,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2022-04-28 10:06:01,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:01,498 INFO L225 Difference]: With dead ends: 152 [2022-04-28 10:06:01,499 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 10:06:01,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=2714, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:06:01,499 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:01,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 10:06:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2022-04-28 10:06:01,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:01,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:01,853 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:01,853 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:01,855 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-28 10:06:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-28 10:06:01,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:01,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:01,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 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 138 states. [2022-04-28 10:06:01,855 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 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 138 states. [2022-04-28 10:06:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:01,856 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-28 10:06:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-28 10:06:01,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:01,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:01,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:01,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2022-04-28 10:06:01,858 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 35 [2022-04-28 10:06:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:01,858 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2022-04-28 10:06:01,858 INFO L496 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-28 10:06:01,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 165 transitions. [2022-04-28 10:06:02,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2022-04-28 10:06:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:06:02,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:02,147 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:02,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-28 10:06:02,347 WARN L477 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-28 10:06:02,347 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 101 times [2022-04-28 10:06:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:02,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778446935] [2022-04-28 10:06:02,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:02,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 102 times [2022-04-28 10:06:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:02,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675009858] [2022-04-28 10:06:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:02,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {40417#(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); {40398#true} is VALID [2022-04-28 10:06:02,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-28 10:06:02,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-28 10:06:02,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40417#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:02,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {40417#(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); {40398#true} is VALID [2022-04-28 10:06:02,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-28 10:06:02,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-28 10:06:02,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-28 10:06:02,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40403#(= main_~y~0 0)} is VALID [2022-04-28 10:06:02,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {40403#(= 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; {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:02,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {40404#(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; {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:02,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {40405#(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; {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:02,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {40406#(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; {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:02,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {40407#(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; {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:02,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {40408#(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; {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:02,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {40409#(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; {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:02,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {40410#(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; {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:02,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {40411#(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; {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:02,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:02,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:02,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {40413#(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; {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:02,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {40414#(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; {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {40415#(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; {40416#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {40416#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-28 10:06:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675009858] [2022-04-28 10:06:02,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675009858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:02,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443019181] [2022-04-28 10:06:02,563 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:02,564 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-28 10:06:02,565 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-28 10:06:02,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:06:02,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:02,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:06:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:02,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:02,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40398#true} is VALID [2022-04-28 10:06:02,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#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); {40398#true} is VALID [2022-04-28 10:06:02,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-28 10:06:02,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-28 10:06:02,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-28 10:06:02,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40403#(= main_~y~0 0)} is VALID [2022-04-28 10:06:02,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {40403#(= 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; {40404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:02,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {40404#(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; {40405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:02,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {40405#(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; {40406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:02,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {40406#(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; {40407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:02,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {40407#(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; {40408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:02,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {40408#(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; {40409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:02,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {40409#(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; {40410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:02,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {40410#(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; {40411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:02,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {40411#(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; {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:02,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:02,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {40412#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {40413#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:02,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {40413#(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; {40414#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:02,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {40414#(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; {40415#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:02,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {40415#(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; {40478#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:02,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {40478#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:02,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-28 10:06:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:02,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:03,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-04-28 10:06:03,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {40399#false} assume 0 == ~cond; {40399#false} is VALID [2022-04-28 10:06:03,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {40399#false} ~cond := #in~cond; {40399#false} is VALID [2022-04-28 10:06:03,356 INFO L272 TraceCheckUtils]: 31: Hoare triple {40399#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {40399#false} assume !(~y~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {40399#false} is VALID [2022-04-28 10:06:03,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {40566#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40399#false} is VALID [2022-04-28 10:06:03,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {40570#(< 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; {40566#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:03,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {40574#(< 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; {40570#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:03,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {40578#(< 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; {40574#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:03,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {40578#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:03,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:03,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {40589#(< 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; {40582#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:03,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {40593#(< 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; {40589#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:03,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {40597#(< 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; {40593#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:03,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {40601#(< 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; {40597#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:03,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {40605#(< 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; {40601#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:03,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {40609#(< 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; {40605#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:03,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {40613#(< 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; {40609#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:03,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {40617#(< 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; {40613#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:03,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {40621#(< 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; {40617#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:03,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {40398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40621#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:03,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {40398#true} call #t~ret11 := main(); {40398#true} is VALID [2022-04-28 10:06:03,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40398#true} {40398#true} #61#return; {40398#true} is VALID [2022-04-28 10:06:03,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {40398#true} assume true; {40398#true} is VALID [2022-04-28 10:06:03,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {40398#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); {40398#true} is VALID [2022-04-28 10:06:03,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {40398#true} call ULTIMATE.init(); {40398#true} is VALID [2022-04-28 10:06:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443019181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:03,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:06:03,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:03,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778446935] [2022-04-28 10:06:03,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778446935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:03,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:03,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:06:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911175631] [2022-04-28 10:06:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:03,371 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 35 [2022-04-28 10:06:03,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:03,371 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-28 10:06:03,391 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-28 10:06:03,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:06:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:06:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:06:03,392 INFO L87 Difference]: Start difference. First operand 128 states and 165 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-28 10:06:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:04,951 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2022-04-28 10:06:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:06:04,951 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 35 [2022-04-28 10:06:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:04,951 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-28 10:06:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2022-04-28 10:06:04,952 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-28 10:06:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2022-04-28 10:06:04,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 66 transitions. [2022-04-28 10:06:05,002 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-28 10:06:05,004 INFO L225 Difference]: With dead ends: 155 [2022-04-28 10:06:05,004 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 10:06:05,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=509, Invalid=2041, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:06:05,004 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:05,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 10:06:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2022-04-28 10:06:05,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:05,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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-28 10:06:05,353 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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-28 10:06:05,353 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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-28 10:06:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:05,355 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-28 10:06:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 10:06:05,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:05,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:05,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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 140 states. [2022-04-28 10:06:05,355 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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 140 states. [2022-04-28 10:06:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:05,356 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-28 10:06:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 10:06:05,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:05,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:05,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:05,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 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-28 10:06:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2022-04-28 10:06:05,358 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 35 [2022-04-28 10:06:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:05,358 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2022-04-28 10:06:05,358 INFO L496 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-28 10:06:05,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 166 transitions. [2022-04-28 10:06:05,650 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-28 10:06:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2022-04-28 10:06:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:06:05,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:05,651 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:05,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-28 10:06:05,851 WARN L477 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-28 10:06:05,851 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:05,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1360843247, now seen corresponding path program 103 times [2022-04-28 10:06:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:05,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298782234] [2022-04-28 10:06:05,853 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:05,854 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1360843247, now seen corresponding path program 104 times [2022-04-28 10:06:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874691901] [2022-04-28 10:06:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:06,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:06,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {41554#(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); {41528#true} is VALID [2022-04-28 10:06:06,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-28 10:06:06,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-28 10:06:06,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:06,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {41554#(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); {41528#true} is VALID [2022-04-28 10:06:06,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-28 10:06:06,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-28 10:06:06,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-28 10:06:06,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41533#(= main_~y~0 0)} is VALID [2022-04-28 10:06:06,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {41533#(= 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; {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:06,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {41534#(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; {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:06,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {41535#(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; {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:06,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {41536#(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; {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:06,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {41537#(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; {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:06,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {41538#(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; {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:06,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {41539#(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; {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:06,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {41540#(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; {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:06,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {41541#(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; {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:06,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {41542#(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; {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:06,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {41543#(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; {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:06,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {41544#(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; {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:06,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {41545#(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; {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:06,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {41546#(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; {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:06,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {41547#(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; {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:06,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {41548#(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; {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:06,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {41549#(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; {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:06,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {41550#(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; {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:06,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:06,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:06:06,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41553#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:06:06,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {41553#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:06,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:06,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-28 10:06:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:06,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874691901] [2022-04-28 10:06:06,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874691901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:06,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784191253] [2022-04-28 10:06:06,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:06,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:06,224 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-28 10:06:06,225 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-28 10:06:06,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:06,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:06,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:06:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:06,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:06,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41528#true} is VALID [2022-04-28 10:06:06,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#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); {41528#true} is VALID [2022-04-28 10:06:06,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-28 10:06:06,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-28 10:06:06,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-28 10:06:06,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41533#(= main_~y~0 0)} is VALID [2022-04-28 10:06:06,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {41533#(= 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; {41534#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:06,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {41534#(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; {41535#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:06,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {41535#(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; {41536#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:06,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {41536#(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; {41537#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:06,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {41537#(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; {41538#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:06,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {41538#(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; {41539#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:06,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {41539#(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; {41540#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:06,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {41540#(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; {41541#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:06,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {41541#(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; {41542#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:06,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {41542#(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; {41543#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:06,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {41543#(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; {41544#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:06,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {41544#(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; {41545#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:06,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {41545#(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; {41546#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:06,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {41546#(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; {41547#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:06,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {41547#(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; {41548#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:06,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {41548#(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; {41549#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:06,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {41549#(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; {41550#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:06,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {41550#(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; {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:06,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:06,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {41551#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:06:06,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {41552#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41636#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:06:06,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {41636#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:06,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:06,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-28 10:06:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:06,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {41529#false} assume !false; {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {41529#false} assume 0 == ~cond; {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {41529#false} ~cond := #in~cond; {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L272 TraceCheckUtils]: 31: Hoare triple {41529#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {41529#false} assume !(~y~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {41529#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {41529#false} is VALID [2022-04-28 10:06:07,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {41682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41529#false} is VALID [2022-04-28 10:06:07,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {41686#(< 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; {41682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:07,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {41686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:07,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:07,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {41697#(< 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; {41690#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:07,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {41701#(< 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; {41697#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:07,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {41705#(< 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; {41701#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:07,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {41709#(< 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; {41705#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:07,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {41713#(< 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; {41709#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:07,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {41717#(< 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; {41713#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:07,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {41721#(< 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; {41717#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:07,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {41725#(< 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; {41721#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:07,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {41729#(< 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; {41725#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:07,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {41733#(< 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; {41729#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:07,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {41737#(< 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; {41733#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:07,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {41741#(< 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; {41737#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:06:07,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {41745#(< 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; {41741#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:06:07,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {41749#(< 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; {41745#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:06:07,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {41753#(< 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; {41749#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:06:07,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {41757#(< 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; {41753#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:06:07,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {41761#(< 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; {41757#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:06:07,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {41765#(< 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; {41761#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:06:07,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {41528#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41765#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:06:07,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {41528#true} call #t~ret11 := main(); {41528#true} is VALID [2022-04-28 10:06:07,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41528#true} {41528#true} #61#return; {41528#true} is VALID [2022-04-28 10:06:07,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {41528#true} assume true; {41528#true} is VALID [2022-04-28 10:06:07,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {41528#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); {41528#true} is VALID [2022-04-28 10:06:07,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {41528#true} call ULTIMATE.init(); {41528#true} is VALID [2022-04-28 10:06:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:07,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784191253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:07,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:07,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:06:07,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:07,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298782234] [2022-04-28 10:06:07,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298782234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:07,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:07,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:06:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410094795] [2022-04-28 10:06:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:07,334 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 35 [2022-04-28 10:06:07,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:07,335 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-28 10:06:07,356 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-28 10:06:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:06:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:06:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:06:07,357 INFO L87 Difference]: Start difference. First operand 129 states and 166 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-28 10:06:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:10,685 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2022-04-28 10:06:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:06:10,685 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 35 [2022-04-28 10:06:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:10,685 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-28 10:06:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-28 10:06:10,686 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-28 10:06:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-28 10:06:10,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 132 transitions. [2022-04-28 10:06:10,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:10,793 INFO L225 Difference]: With dead ends: 201 [2022-04-28 10:06:10,793 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 10:06:10,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:06:10,794 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:10,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 151 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:06:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 10:06:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 135. [2022-04-28 10:06:11,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:11,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:11,161 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:11,161 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:11,164 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-28 10:06:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-28 10:06:11,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:11,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:11,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:06:11,164 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:06:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:11,167 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-28 10:06:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-28 10:06:11,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:11,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:11,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:11,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2022-04-28 10:06:11,170 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 35 [2022-04-28 10:06:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:11,170 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2022-04-28 10:06:11,170 INFO L496 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-28 10:06:11,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 174 transitions. [2022-04-28 10:06:11,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2022-04-28 10:06:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:06:11,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:11,491 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:11,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 10:06:11,691 WARN L477 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-28 10:06:11,692 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1944519039, now seen corresponding path program 105 times [2022-04-28 10:06:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:11,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928508717] [2022-04-28 10:06:11,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:11,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1944519039, now seen corresponding path program 106 times [2022-04-28 10:06:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:11,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033013149] [2022-04-28 10:06:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:11,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {42909#(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); {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:11,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {42909#(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); {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-28 10:06:11,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-28 10:06:11,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42893#(= main_~y~0 0)} is VALID [2022-04-28 10:06:11,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {42893#(= 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; {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:11,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {42894#(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; {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:11,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {42895#(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; {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:11,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {42896#(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; {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:11,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {42897#(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; {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:11,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {42898#(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; {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:11,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {42899#(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; {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:11,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:11,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:11,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {42901#(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; {42902#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:11,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {42902#(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; {42903#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:11,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {42903#(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; {42904#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:11,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {42904#(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; {42905#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:11,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {42905#(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; {42906#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:11,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {42906#(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; {42907#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:11,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {42907#(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; {42908#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {42908#(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; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {42889#false} assume !(~z~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {42889#false} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-28 10:06:11,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-28 10:06:11,962 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-28 10:06:11,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033013149] [2022-04-28 10:06:11,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033013149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221345689] [2022-04-28 10:06:11,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:11,964 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-28 10:06:11,964 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-28 10:06:12,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:12,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:06:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:12,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:12,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42888#true} is VALID [2022-04-28 10:06:12,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#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); {42888#true} is VALID [2022-04-28 10:06:12,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-28 10:06:12,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-28 10:06:12,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-28 10:06:12,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42893#(= main_~y~0 0)} is VALID [2022-04-28 10:06:12,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {42893#(= 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; {42894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:12,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {42894#(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; {42895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:12,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {42895#(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; {42896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:12,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {42896#(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; {42897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:12,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {42897#(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; {42898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:12,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {42898#(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; {42899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:12,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {42899#(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; {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {42900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {42955#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {42955#(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; {42959#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:12,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {42959#(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; {42963#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {42963#(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; {42967#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:06:12,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {42967#(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; {42971#(and (= main_~y~0 (+ main_~z~0 4)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {42971#(and (= main_~y~0 (+ main_~z~0 4)) (<= 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; {42975#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {42975#(and (= (+ main_~y~0 (- 4)) (+ 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; {42979#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:12,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {42979#(and (= (+ main_~y~0 (- 4)) (+ 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; {42983#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} is VALID [2022-04-28 10:06:12,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {42983#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 4)) (+ 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; {42889#false} is VALID [2022-04-28 10:06:12,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {42889#false} assume !(~z~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-28 10:06:12,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {42889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {42889#false} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-28 10:06:12,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-28 10:06:12,356 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-28 10:06:12,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:12,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {42889#false} assume !false; {42889#false} is VALID [2022-04-28 10:06:12,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {42889#false} assume 0 == ~cond; {42889#false} is VALID [2022-04-28 10:06:12,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {42889#false} ~cond := #in~cond; {42889#false} is VALID [2022-04-28 10:06:12,987 INFO L272 TraceCheckUtils]: 32: Hoare triple {42889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42889#false} is VALID [2022-04-28 10:06:12,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {43038#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42889#false} is VALID [2022-04-28 10:06:12,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {43042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:12,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {43046#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:12,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {43050#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43046#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:12,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {43054#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43050#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:13,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {43058#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43054#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:13,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {43062#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43058#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:13,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43062#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:13,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:06:13,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {43073#(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; {43066#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:06:13,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {43077#(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; {43073#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:06:13,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {43081#(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; {43077#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:06:13,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {43085#(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; {43081#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:06:13,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {43089#(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; {43085#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:06:13,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {43093#(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; {43089#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:06:13,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {43097#(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; {43093#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {43101#(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; {43097#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {42888#true} ~z~0 := ~y~0; {43101#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {42888#true} assume !(~x~0 % 4294967296 > 0); {42888#true} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {42888#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; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {42888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {42888#true} call #t~ret11 := main(); {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42888#true} {42888#true} #61#return; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {42888#true} assume true; {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {42888#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); {42888#true} is VALID [2022-04-28 10:06:13,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {42888#true} call ULTIMATE.init(); {42888#true} is VALID [2022-04-28 10:06:13,013 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-28 10:06:13,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221345689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:13,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:13,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-28 10:06:13,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928508717] [2022-04-28 10:06:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928508717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:13,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795415419] [2022-04-28 10:06:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:13,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:13,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:13,038 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-28 10:06:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:06:13,039 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:14,296 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2022-04-28 10:06:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:06:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-04-28 10:06:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-04-28 10:06:14,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-04-28 10:06:14,328 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-28 10:06:14,330 INFO L225 Difference]: With dead ends: 148 [2022-04-28 10:06:14,330 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 10:06:14,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=555, Invalid=2867, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:06:14,330 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:14,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 10:06:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-28 10:06:14,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:14,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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-28 10:06:14,661 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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-28 10:06:14,661 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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-28 10:06:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:14,662 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2022-04-28 10:06:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-28 10:06:14,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:14,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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 125 states. [2022-04-28 10:06:14,663 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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 125 states. [2022-04-28 10:06:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:14,664 INFO L93 Difference]: Finished difference Result 125 states and 162 transitions. [2022-04-28 10:06:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-28 10:06:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:14,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:14,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:14,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 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-28 10:06:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2022-04-28 10:06:14,665 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 36 [2022-04-28 10:06:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:14,665 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2022-04-28 10:06:14,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-28 10:06:14,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 162 transitions. [2022-04-28 10:06:14,937 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-28 10:06:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2022-04-28 10:06:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:06:14,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:14,937 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:14,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-28 10:06:15,137 WARN L477 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-28 10:06:15,138 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 107 times [2022-04-28 10:06:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:15,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041139448] [2022-04-28 10:06:15,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:15,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 108 times [2022-04-28 10:06:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:15,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969449764] [2022-04-28 10:06:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:15,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {43998#(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); {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:15,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {43998#(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); {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-28 10:06:15,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-28 10:06:15,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43982#(= main_~y~0 0)} is VALID [2022-04-28 10:06:15,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {43982#(= 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; {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:15,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {43983#(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; {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:15,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {43984#(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; {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:15,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {43985#(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; {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:15,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {43986#(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; {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:15,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {43987#(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; {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:15,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {43988#(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; {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:15,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {43989#(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; {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {43991#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:15,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {43991#(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; {43992#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:15,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {43992#(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; {43993#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:15,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {43993#(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; {43994#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:15,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {43994#(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; {43995#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:15,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {43995#(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; {43996#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:15,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {43996#(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; {43997#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {43997#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-28 10:06:15,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-28 10:06:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:15,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969449764] [2022-04-28 10:06:15,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969449764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:15,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610169064] [2022-04-28 10:06:15,408 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:15,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:15,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:15,409 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-28 10:06:15,410 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-28 10:06:15,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:06:15,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:15,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:06:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:15,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:15,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43977#true} is VALID [2022-04-28 10:06:15,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#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); {43977#true} is VALID [2022-04-28 10:06:15,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-28 10:06:15,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-28 10:06:15,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-28 10:06:15,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43982#(= main_~y~0 0)} is VALID [2022-04-28 10:06:15,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {43982#(= 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; {43983#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:15,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {43983#(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; {43984#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:15,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {43984#(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; {43985#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:15,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {43985#(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; {43986#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:15,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {43986#(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; {43987#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:15,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {43987#(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; {43988#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:15,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {43988#(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; {43989#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:15,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {43989#(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; {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {43990#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {44047#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {44047#(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; {44051#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:15,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {44051#(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; {44055#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {44055#(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; {44059#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {44059#(and (= (+ (- 2) main_~y~0) (+ 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; {44063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:06:15,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {44063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44067#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {44067#(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; {44071#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {44071#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-28 10:06:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:15,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:16,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {43978#false} assume !false; {43978#false} is VALID [2022-04-28 10:06:16,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {43978#false} assume 0 == ~cond; {43978#false} is VALID [2022-04-28 10:06:16,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {43978#false} ~cond := #in~cond; {43978#false} is VALID [2022-04-28 10:06:16,296 INFO L272 TraceCheckUtils]: 32: Hoare triple {43978#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {43978#false} is VALID [2022-04-28 10:06:16,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {43978#false} assume !(~y~0 % 4294967296 > 0); {43978#false} is VALID [2022-04-28 10:06:16,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {43978#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:16,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {44132#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {43978#false} is VALID [2022-04-28 10:06:16,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {44136#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44132#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:16,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {44140#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44136#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:16,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {44144#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44140#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:16,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {44148#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44144#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:16,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {44152#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44148#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:16,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {44156#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {44152#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:16,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {44160#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {44156#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:16,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {44164#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 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; {44160#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {44168#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {44164#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {44172#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 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; {44168#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {44176#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 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; {44172#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {44180#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 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; {44176#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {44184#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 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; {44180#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {43977#true} ~z~0 := ~y~0; {44184#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {43977#true} assume !(~x~0 % 4294967296 > 0); {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {43977#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; {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {43977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {43977#true} call #t~ret11 := main(); {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43977#true} {43977#true} #61#return; {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {43977#true} assume true; {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {43977#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); {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {43977#true} call ULTIMATE.init(); {43977#true} is VALID [2022-04-28 10:06:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:06:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610169064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:16,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:16,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 40 [2022-04-28 10:06:16,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:16,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041139448] [2022-04-28 10:06:16,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041139448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:16,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:16,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575657142] [2022-04-28 10:06:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:16,308 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 36 [2022-04-28 10:06:16,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:16,308 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-28 10:06:16,334 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-28 10:06:16,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:16,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:06:16,335 INFO L87 Difference]: Start difference. First operand 125 states and 162 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-28 10:06:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:17,622 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2022-04-28 10:06:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:06:17,622 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 36 [2022-04-28 10:06:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:17,622 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-28 10:06:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-28 10:06:17,623 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-28 10:06:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-28 10:06:17,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2022-04-28 10:06:17,665 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-28 10:06:17,666 INFO L225 Difference]: With dead ends: 150 [2022-04-28 10:06:17,666 INFO L226 Difference]: Without dead ends: 136 [2022-04-28 10:06:17,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2722, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:06:17,667 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:17,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-28 10:06:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2022-04-28 10:06:18,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:18,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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-28 10:06:18,003 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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-28 10:06:18,003 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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-28 10:06:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:18,004 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-28 10:06:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-28 10:06:18,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:18,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:18,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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 136 states. [2022-04-28 10:06:18,005 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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 136 states. [2022-04-28 10:06:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:18,006 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-28 10:06:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-04-28 10:06:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:18,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:18,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:18,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 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-28 10:06:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2022-04-28 10:06:18,007 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 36 [2022-04-28 10:06:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:18,008 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2022-04-28 10:06:18,008 INFO L496 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-28 10:06:18,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2022-04-28 10:06:18,286 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-28 10:06:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2022-04-28 10:06:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:06:18,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:18,286 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:18,304 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-28 10:06:18,487 WARN L477 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-28 10:06:18,487 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 109 times [2022-04-28 10:06:18,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:18,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103340528] [2022-04-28 10:06:18,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:18,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 110 times [2022-04-28 10:06:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:18,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392300170] [2022-04-28 10:06:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:18,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {45111#(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); {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:18,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {45111#(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); {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-28 10:06:18,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-28 10:06:18,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45096#(= main_~y~0 0)} is VALID [2022-04-28 10:06:18,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {45096#(= 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; {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:18,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {45097#(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; {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:18,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {45098#(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; {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:18,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {45099#(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; {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:18,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {45100#(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; {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:18,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {45101#(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; {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {45102#(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; {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:18,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {45103#(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; {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:18,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {45104#(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; {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:18,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:18,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:18,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {45106#(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; {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:18,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {45107#(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; {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:18,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {45108#(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; {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {45109#(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; {45110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {45110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-28 10:06:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392300170] [2022-04-28 10:06:18,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392300170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605942080] [2022-04-28 10:06:18,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:18,741 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-28 10:06:18,742 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-28 10:06:18,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:18,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:18,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:06:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:18,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:19,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45091#true} is VALID [2022-04-28 10:06:19,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#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); {45091#true} is VALID [2022-04-28 10:06:19,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-28 10:06:19,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-28 10:06:19,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-28 10:06:19,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45096#(= main_~y~0 0)} is VALID [2022-04-28 10:06:19,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {45096#(= 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; {45097#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:19,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {45097#(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; {45098#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:19,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {45098#(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; {45099#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:19,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {45099#(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; {45100#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:19,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {45100#(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; {45101#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:19,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {45101#(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; {45102#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:19,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {45102#(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; {45103#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:19,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {45103#(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; {45104#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:19,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {45104#(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; {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:19,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:19,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {45105#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {45106#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:19,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {45106#(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; {45107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:19,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {45107#(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; {45108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:19,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {45108#(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; {45109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {45109#(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; {45175#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {45175#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-28 10:06:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:19,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:19,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {45092#false} assume !false; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {45092#false} assume 0 == ~cond; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {45092#false} ~cond := #in~cond; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L272 TraceCheckUtils]: 32: Hoare triple {45092#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {45092#false} assume !(~y~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {45092#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {45092#false} is VALID [2022-04-28 10:06:19,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {45263#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45092#false} is VALID [2022-04-28 10:06:19,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {45267#(< 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; {45263#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:19,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {45271#(< 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; {45267#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:19,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {45275#(< 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; {45271#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:19,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {45279#(< 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; {45275#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:19,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {45279#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:06:19,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:19,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {45290#(< 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; {45283#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:19,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {45294#(< 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; {45290#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:19,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {45298#(< 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; {45294#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:19,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {45302#(< 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; {45298#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:19,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {45306#(< 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; {45302#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:19,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {45310#(< 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; {45306#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:19,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {45314#(< 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; {45310#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:19,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {45318#(< 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; {45314#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:19,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {45322#(< 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; {45318#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:19,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {45091#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45322#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:19,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {45091#true} call #t~ret11 := main(); {45091#true} is VALID [2022-04-28 10:06:19,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45091#true} {45091#true} #61#return; {45091#true} is VALID [2022-04-28 10:06:19,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {45091#true} assume true; {45091#true} is VALID [2022-04-28 10:06:19,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {45091#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); {45091#true} is VALID [2022-04-28 10:06:19,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {45091#true} call ULTIMATE.init(); {45091#true} is VALID [2022-04-28 10:06:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:19,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605942080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:19,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:19,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:06:19,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:19,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103340528] [2022-04-28 10:06:19,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103340528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:19,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:19,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:06:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499584717] [2022-04-28 10:06:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:19,486 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 36 [2022-04-28 10:06:19,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:19,486 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-28 10:06:19,503 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-28 10:06:19,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:06:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:06:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:06:19,504 INFO L87 Difference]: Start difference. First operand 126 states and 163 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-28 10:06:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,011 INFO L93 Difference]: Finished difference Result 153 states and 190 transitions. [2022-04-28 10:06:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:06:21,011 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 36 [2022-04-28 10:06:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:21,011 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-28 10:06:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-28 10:06:21,011 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-28 10:06:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-28 10:06:21,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 62 transitions. [2022-04-28 10:06:21,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:21,064 INFO L225 Difference]: With dead ends: 153 [2022-04-28 10:06:21,064 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 10:06:21,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:06:21,065 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:21,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:06:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 10:06:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2022-04-28 10:06:21,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:21,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:21,402 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:21,402 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,404 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-28 10:06:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-28 10:06:21,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 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 138 states. [2022-04-28 10:06:21,404 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 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 138 states. [2022-04-28 10:06:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,405 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-04-28 10:06:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2022-04-28 10:06:21,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:21,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:21,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:21,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 122 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2022-04-28 10:06:21,407 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 36 [2022-04-28 10:06:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:21,407 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2022-04-28 10:06:21,407 INFO L496 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-28 10:06:21,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 164 transitions. [2022-04-28 10:06:21,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2022-04-28 10:06:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:06:21,685 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:21,685 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:21,701 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-28 10:06:21,885 WARN L477 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-28 10:06:21,885 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 111 times [2022-04-28 10:06:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755960576] [2022-04-28 10:06:21,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:21,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 112 times [2022-04-28 10:06:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:21,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70331189] [2022-04-28 10:06:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:22,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {46236#(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); {46217#true} is VALID [2022-04-28 10:06:22,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-28 10:06:22,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-28 10:06:22,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:22,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {46236#(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); {46217#true} is VALID [2022-04-28 10:06:22,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-28 10:06:22,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-28 10:06:22,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-28 10:06:22,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46222#(= main_~y~0 0)} is VALID [2022-04-28 10:06:22,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {46222#(= 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; {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:22,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {46223#(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; {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:22,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {46224#(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; {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:22,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {46225#(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; {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:22,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {46226#(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; {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:22,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {46227#(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; {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:22,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {46228#(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; {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:22,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {46229#(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; {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:22,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {46230#(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; {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:22,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {46231#(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; {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:22,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:22,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:22,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {46233#(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; {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {46234#(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; {46235#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {46235#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-28 10:06:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:22,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70331189] [2022-04-28 10:06:22,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70331189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:22,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350664284] [2022-04-28 10:06:22,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:22,115 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-28 10:06:22,116 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-28 10:06:22,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:22,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:22,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:06:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:22,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:22,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46217#true} is VALID [2022-04-28 10:06:22,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#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); {46217#true} is VALID [2022-04-28 10:06:22,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-28 10:06:22,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-28 10:06:22,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-28 10:06:22,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46222#(= main_~y~0 0)} is VALID [2022-04-28 10:06:22,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {46222#(= 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; {46223#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:22,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {46223#(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; {46224#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:22,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {46224#(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; {46225#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:22,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {46225#(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; {46226#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:22,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {46226#(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; {46227#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:22,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {46227#(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; {46228#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:22,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {46228#(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; {46229#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:22,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {46229#(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; {46230#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:22,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {46230#(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; {46231#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:22,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {46231#(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; {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:22,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:22,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {46232#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {46233#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:22,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {46233#(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; {46234#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:22,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {46234#(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; {46297#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:22,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {46297#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-28 10:06:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:22,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:22,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {46218#false} assume !false; {46218#false} is VALID [2022-04-28 10:06:22,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {46218#false} assume 0 == ~cond; {46218#false} is VALID [2022-04-28 10:06:22,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {46218#false} ~cond := #in~cond; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L272 TraceCheckUtils]: 32: Hoare triple {46218#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {46218#false} assume !(~y~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {46218#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {46218#false} is VALID [2022-04-28 10:06:22,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {46391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46218#false} is VALID [2022-04-28 10:06:22,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {46395#(< 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; {46391#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:22,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {46399#(< 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; {46395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:22,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {46399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:22,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:22,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {46410#(< 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; {46403#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:22,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {46414#(< 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; {46410#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:22,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {46418#(< 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; {46414#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:22,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {46422#(< 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; {46418#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:22,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {46426#(< 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; {46422#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:22,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {46430#(< 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; {46426#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:22,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {46434#(< 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; {46430#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:22,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {46438#(< 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; {46434#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:22,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {46442#(< 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; {46438#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:22,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {46446#(< 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; {46442#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:22,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {46217#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46446#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:22,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {46217#true} call #t~ret11 := main(); {46217#true} is VALID [2022-04-28 10:06:22,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46217#true} {46217#true} #61#return; {46217#true} is VALID [2022-04-28 10:06:22,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {46217#true} assume true; {46217#true} is VALID [2022-04-28 10:06:22,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {46217#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); {46217#true} is VALID [2022-04-28 10:06:22,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {46217#true} call ULTIMATE.init(); {46217#true} is VALID [2022-04-28 10:06:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350664284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:22,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:22,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:06:22,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755960576] [2022-04-28 10:06:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755960576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:22,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:22,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:06:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694946528] [2022-04-28 10:06:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:22,797 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 36 [2022-04-28 10:06:22,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:22,798 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-28 10:06:22,814 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-28 10:06:22,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:06:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:06:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:06:22,815 INFO L87 Difference]: Start difference. First operand 127 states and 164 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-28 10:06:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,229 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2022-04-28 10:06:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:24,229 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 36 [2022-04-28 10:06:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:24,229 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-28 10:06:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-28 10:06:24,230 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-28 10:06:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-28 10:06:24,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 65 transitions. [2022-04-28 10:06:24,281 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-28 10:06:24,282 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:06:24,283 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 10:06:24,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 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-28 10:06:24,283 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:24,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:06:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 10:06:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2022-04-28 10:06:24,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:24,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:24,630 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:24,631 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,632 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-28 10:06:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 10:06:24,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:24,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:24,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 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 140 states. [2022-04-28 10:06:24,632 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 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 140 states. [2022-04-28 10:06:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:24,633 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2022-04-28 10:06:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 10:06:24,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:24,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:24,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:24,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2022-04-28 10:06:24,635 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 36 [2022-04-28 10:06:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:24,635 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2022-04-28 10:06:24,635 INFO L496 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-28 10:06:24,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 165 transitions. [2022-04-28 10:06:24,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2022-04-28 10:06:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:06:24,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:24,939 INFO L195 NwaCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:24,954 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-28 10:06:25,139 WARN L477 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-28 10:06:25,139 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1307083474, now seen corresponding path program 113 times [2022-04-28 10:06:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738265730] [2022-04-28 10:06:25,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:25,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1307083474, now seen corresponding path program 114 times [2022-04-28 10:06:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011836636] [2022-04-28 10:06:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {47376#(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); {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:25,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {47376#(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); {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-28 10:06:25,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-28 10:06:25,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47354#(= main_~y~0 0)} is VALID [2022-04-28 10:06:25,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {47354#(= 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; {47355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:25,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {47355#(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; {47356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:25,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {47356#(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; {47357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {47357#(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; {47358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:25,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {47358#(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; {47359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:25,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {47359#(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; {47360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:25,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {47360#(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; {47361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:25,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {47361#(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; {47362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:25,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {47362#(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; {47363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:25,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {47363#(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; {47364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:25,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {47364#(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; {47365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:25,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {47365#(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; {47366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:25,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {47366#(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; {47367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:25,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {47367#(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; {47368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:25,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {47368#(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; {47369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:25,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {47369#(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; {47370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:25,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {47370#(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; {47371#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:25,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {47371#(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; {47372#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:25,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {47372#(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; {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:06:25,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:06:25,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {47373#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {47374#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:06:25,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {47374#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47375#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {47375#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {47350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {47350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-28 10:06:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011836636] [2022-04-28 10:06:25,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011836636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335860301] [2022-04-28 10:06:25,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:25,524 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-28 10:06:25,547 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-28 10:06:25,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:06:25,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:25,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:06:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:25,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:25,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#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); {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {47349#true} assume !(~x~0 % 4294967296 > 0); {47349#true} is VALID [2022-04-28 10:06:25,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {47349#true} ~z~0 := ~y~0; {47458#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:06:25,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {47458#(= 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; {47462#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:06:25,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {47462#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47470#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {47470#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-28 10:06:25,755 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-28 10:06:25,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-28 10:06:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 10:06:25,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:25,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {47350#false} assume !false; {47350#false} is VALID [2022-04-28 10:06:25,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {47350#false} assume 0 == ~cond; {47350#false} is VALID [2022-04-28 10:06:25,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {47350#false} ~cond := #in~cond; {47350#false} is VALID [2022-04-28 10:06:25,920 INFO L272 TraceCheckUtils]: 32: Hoare triple {47350#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {47350#false} is VALID [2022-04-28 10:06:25,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {47350#false} assume !(~y~0 % 4294967296 > 0); {47350#false} is VALID [2022-04-28 10:06:25,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {47470#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47350#false} is VALID [2022-04-28 10:06:25,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {47470#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:25,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {47510#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {47466#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:25,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {47514#(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; {47510#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {47349#true} ~z~0 := ~y~0; {47514#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {47349#true} assume !(~x~0 % 4294967296 > 0); {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {47349#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; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {47349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {47349#true} call #t~ret11 := main(); {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47349#true} {47349#true} #61#return; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {47349#true} assume true; {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {47349#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); {47349#true} is VALID [2022-04-28 10:06:25,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {47349#true} call ULTIMATE.init(); {47349#true} is VALID [2022-04-28 10:06:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-28 10:06:25,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335860301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:25,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 6, 6] total 31 [2022-04-28 10:06:25,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:25,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738265730] [2022-04-28 10:06:25,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738265730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:25,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:06:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818699878] [2022-04-28 10:06:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:25,927 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 36 [2022-04-28 10:06:25,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:25,927 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-28 10:06:25,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-28 10:06:25,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:06:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:06:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:06:25,952 INFO L87 Difference]: Start difference. First operand 128 states and 165 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-28 10:06:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,456 INFO L93 Difference]: Finished difference Result 201 states and 287 transitions. [2022-04-28 10:06:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:06:29,456 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 36 [2022-04-28 10:06:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:29,456 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-28 10:06:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2022-04-28 10:06:29,458 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-28 10:06:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2022-04-28 10:06:29,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 135 transitions. [2022-04-28 10:06:29,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:29,566 INFO L225 Difference]: With dead ends: 201 [2022-04-28 10:06:29,567 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 10:06:29,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=2679, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:06:29,567 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:29,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 151 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:06:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 10:06:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2022-04-28 10:06:29,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:29,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,938 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,938 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,940 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-28 10:06:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-28 10:06:29,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:06:29,940 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 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 193 states. [2022-04-28 10:06:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:29,942 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-04-28 10:06:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-04-28 10:06:29,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:29,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:29,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:29,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2022-04-28 10:06:29,944 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 36 [2022-04-28 10:06:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:29,944 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2022-04-28 10:06:29,944 INFO L496 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-28 10:06:29,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 173 transitions. [2022-04-28 10:06:30,238 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-28 10:06:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-04-28 10:06:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:06:30,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:30,239 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:30,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-04-28 10:06:30,439 WARN L477 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-28 10:06:30,439 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 115 times [2022-04-28 10:06:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:30,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866776303] [2022-04-28 10:06:30,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:30,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 116 times [2022-04-28 10:06:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:30,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866949941] [2022-04-28 10:06:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {48722#(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); {48700#true} is VALID [2022-04-28 10:06:30,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-28 10:06:30,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-28 10:06:30,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:30,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {48722#(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); {48700#true} is VALID [2022-04-28 10:06:30,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-28 10:06:30,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-28 10:06:30,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-28 10:06:30,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48705#(= main_~y~0 0)} is VALID [2022-04-28 10:06:30,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {48705#(= 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; {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:30,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {48706#(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; {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:30,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {48707#(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; {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:30,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {48708#(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; {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:30,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {48709#(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; {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:30,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {48710#(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; {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:30,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {48711#(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; {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:30,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {48712#(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; {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:30,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:30,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {48714#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:30,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {48714#(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; {48715#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:30,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {48715#(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; {48716#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:30,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {48716#(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; {48717#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:30,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {48717#(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; {48718#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:30,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {48718#(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; {48719#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:30,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {48719#(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; {48720#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:30,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {48720#(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; {48721#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:30,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {48721#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-28 10:06:30,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-28 10:06:30,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-28 10:06:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:30,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866949941] [2022-04-28 10:06:30,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866949941] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:30,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429480382] [2022-04-28 10:06:30,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:30,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:30,780 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-28 10:06:30,803 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-28 10:06:30,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:30,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:30,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 10:06:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:31,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48700#true} is VALID [2022-04-28 10:06:31,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#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); {48700#true} is VALID [2022-04-28 10:06:31,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-28 10:06:31,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-28 10:06:31,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-28 10:06:31,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48705#(= main_~y~0 0)} is VALID [2022-04-28 10:06:31,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {48705#(= 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; {48706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:31,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {48706#(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; {48707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:31,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {48707#(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; {48708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:31,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {48708#(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; {48709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:31,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {48709#(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; {48710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:31,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {48710#(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; {48711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {48711#(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; {48712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:31,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {48712#(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; {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {48713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {48771#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {48771#(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; {48775#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:31,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {48775#(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; {48779#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {48779#(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; {48783#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {48783#(and (= (+ (- 2) main_~y~0) (+ 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; {48787#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {48787#(and (= (+ main_~y~0 (- 3)) (+ 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; {48791#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {48791#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ 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; {48795#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {48795#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 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; {48799#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {48799#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {48701#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-28 10:06:31,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-28 10:06:31,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-28 10:06:31,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-28 10:06:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:31,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:31,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {48701#false} assume !false; {48701#false} is VALID [2022-04-28 10:06:31,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {48701#false} assume 0 == ~cond; {48701#false} is VALID [2022-04-28 10:06:31,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {48701#false} ~cond := #in~cond; {48701#false} is VALID [2022-04-28 10:06:31,752 INFO L272 TraceCheckUtils]: 33: Hoare triple {48701#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48701#false} is VALID [2022-04-28 10:06:31,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {48701#false} assume !(~y~0 % 4294967296 > 0); {48701#false} is VALID [2022-04-28 10:06:31,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {48857#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48701#false} is VALID [2022-04-28 10:06:31,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {48861#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48857#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:31,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {48865#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48861#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:31,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {48869#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48865#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:31,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {48873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48869#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:31,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {48877#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48873#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:31,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {48881#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48877#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:31,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {48885#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {48881#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:31,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {48889#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {48885#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:06:31,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {48893#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {48889#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:06:31,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {48897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {48893#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:31,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {48901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {48897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:31,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {48905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {48901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:31,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {48909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {48905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:06:31,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {48913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {48909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {48917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {48913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {48700#true} ~z~0 := ~y~0; {48917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {48700#true} assume !(~x~0 % 4294967296 > 0); {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {48700#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; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {48700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48700#true} is VALID [2022-04-28 10:06:31,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {48700#true} call #t~ret11 := main(); {48700#true} is VALID [2022-04-28 10:06:31,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48700#true} {48700#true} #61#return; {48700#true} is VALID [2022-04-28 10:06:31,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {48700#true} assume true; {48700#true} is VALID [2022-04-28 10:06:31,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {48700#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); {48700#true} is VALID [2022-04-28 10:06:31,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {48700#true} call ULTIMATE.init(); {48700#true} is VALID [2022-04-28 10:06:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429480382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:31,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:31,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 44 [2022-04-28 10:06:31,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866776303] [2022-04-28 10:06:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866776303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:31,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:31,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63060102] [2022-04-28 10:06:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:31,765 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 37 [2022-04-28 10:06:31,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:31,765 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-28 10:06:31,783 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-28 10:06:31,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:06:31,784 INFO L87 Difference]: Start difference. First operand 134 states and 173 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-28 10:06:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,389 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2022-04-28 10:06:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:33,389 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 37 [2022-04-28 10:06:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:33,389 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-28 10:06:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-28 10:06:33,390 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-28 10:06:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-28 10:06:33,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2022-04-28 10:06:33,434 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-28 10:06:33,435 INFO L225 Difference]: With dead ends: 159 [2022-04-28 10:06:33,435 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 10:06:33,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:06:33,436 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:33,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 10:06:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2022-04-28 10:06:33,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:33,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,812 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,812 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,814 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2022-04-28 10:06:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2022-04-28 10:06:33,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:33,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:33,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 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 145 states. [2022-04-28 10:06:33,815 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 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 145 states. [2022-04-28 10:06:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:33,816 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2022-04-28 10:06:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2022-04-28 10:06:33,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:33,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:33,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:33,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2022-04-28 10:06:33,819 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 37 [2022-04-28 10:06:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:33,819 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2022-04-28 10:06:33,819 INFO L496 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-28 10:06:33,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 174 transitions. [2022-04-28 10:06:34,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2022-04-28 10:06:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:06:34,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:34,145 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:34,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-28 10:06:34,347 WARN L477 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-28 10:06:34,347 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 117 times [2022-04-28 10:06:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68019335] [2022-04-28 10:06:34,350 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:34,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 118 times [2022-04-28 10:06:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529386279] [2022-04-28 10:06:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:34,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {49901#(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); {49880#true} is VALID [2022-04-28 10:06:34,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-28 10:06:34,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-28 10:06:34,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:34,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {49901#(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); {49880#true} is VALID [2022-04-28 10:06:34,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-28 10:06:34,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-28 10:06:34,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-28 10:06:34,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49885#(= main_~y~0 0)} is VALID [2022-04-28 10:06:34,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {49885#(= 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; {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:34,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {49886#(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; {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:34,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {49887#(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; {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:34,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {49888#(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; {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:34,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {49889#(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; {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:34,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(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; {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:34,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {49891#(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; {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:34,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {49892#(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; {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:34,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {49893#(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; {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:34,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:34,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:34,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {49895#(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; {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:34,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {49896#(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; {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:34,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {49897#(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; {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:34,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {49898#(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; {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {49899#(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; {49900#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {49900#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-28 10:06:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:34,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529386279] [2022-04-28 10:06:34,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529386279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:34,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684042695] [2022-04-28 10:06:34,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:34,605 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-28 10:06:34,606 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-28 10:06:34,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:34,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:34,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:34,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:34,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49880#true} is VALID [2022-04-28 10:06:34,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#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); {49880#true} is VALID [2022-04-28 10:06:34,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-28 10:06:34,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-28 10:06:34,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-28 10:06:34,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49885#(= main_~y~0 0)} is VALID [2022-04-28 10:06:34,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {49885#(= 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; {49886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:34,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {49886#(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; {49887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:34,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {49887#(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; {49888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:34,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {49888#(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; {49889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:34,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {49889#(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; {49890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:34,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {49890#(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; {49891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:34,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {49891#(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; {49892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:34,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {49892#(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; {49893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:34,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {49893#(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; {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:34,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:34,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {49894#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {49895#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:34,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {49895#(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; {49896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:34,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {49896#(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; {49897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:34,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {49897#(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; {49898#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:34,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {49898#(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; {49899#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:34,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {49899#(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; {49968#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {49968#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:34,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:34,958 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-28 10:06:34,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-28 10:06:34,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-28 10:06:34,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-28 10:06:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:34,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {49881#false} assume !false; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {49881#false} assume 0 == ~cond; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {49881#false} ~cond := #in~cond; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L272 TraceCheckUtils]: 33: Hoare triple {49881#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {49881#false} assume !(~y~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {49881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {49881#false} is VALID [2022-04-28 10:06:35,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {50056#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49881#false} is VALID [2022-04-28 10:06:35,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {50060#(< 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; {50056#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:35,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {50064#(< 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; {50060#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:35,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {50068#(< 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; {50064#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:35,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {50072#(< 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; {50068#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:35,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {50076#(< 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; {50072#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:06:35,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {50076#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:06:35,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:35,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {50087#(< 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; {50080#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:35,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {50091#(< 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; {50087#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:35,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {50095#(< 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; {50091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:35,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {50099#(< 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; {50095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:35,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {50103#(< 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; {50099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:35,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {50107#(< 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; {50103#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:35,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {50111#(< 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; {50107#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:35,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {50115#(< 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; {50111#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:35,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {50119#(< 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; {50115#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:35,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {49880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50119#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:35,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {49880#true} call #t~ret11 := main(); {49880#true} is VALID [2022-04-28 10:06:35,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49880#true} {49880#true} #61#return; {49880#true} is VALID [2022-04-28 10:06:35,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {49880#true} assume true; {49880#true} is VALID [2022-04-28 10:06:35,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {49880#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); {49880#true} is VALID [2022-04-28 10:06:35,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {49880#true} call ULTIMATE.init(); {49880#true} is VALID [2022-04-28 10:06:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684042695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:35,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:06:35,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68019335] [2022-04-28 10:06:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68019335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:35,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355953031] [2022-04-28 10:06:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:35,416 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 37 [2022-04-28 10:06:35,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:35,416 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-28 10:06:35,434 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-28 10:06:35,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:06:35,435 INFO L87 Difference]: Start difference. First operand 135 states and 174 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-28 10:06:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,174 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-04-28 10:06:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:06:37,175 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 37 [2022-04-28 10:06:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:37,175 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-28 10:06:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-28 10:06:37,175 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-28 10:06:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-28 10:06:37,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2022-04-28 10:06:37,225 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-28 10:06:37,226 INFO L225 Difference]: With dead ends: 162 [2022-04-28 10:06:37,226 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 10:06:37,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:06:37,227 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:37,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 10:06:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2022-04-28 10:06:37,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:37,611 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:37,611 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,612 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-04-28 10:06:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2022-04-28 10:06:37,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:37,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:37,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 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 147 states. [2022-04-28 10:06:37,613 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 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 147 states. [2022-04-28 10:06:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,614 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-04-28 10:06:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2022-04-28 10:06:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:37,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:37,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 131 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 175 transitions. [2022-04-28 10:06:37,616 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 175 transitions. Word has length 37 [2022-04-28 10:06:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:37,616 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 175 transitions. [2022-04-28 10:06:37,616 INFO L496 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-28 10:06:37,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 175 transitions. [2022-04-28 10:06:37,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 175 transitions. [2022-04-28 10:06:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:06:37,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:37,917 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:37,933 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-28 10:06:38,117 WARN L477 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-28 10:06:38,117 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 119 times [2022-04-28 10:06:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:38,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642282289] [2022-04-28 10:06:38,120 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:38,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 120 times [2022-04-28 10:06:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750168338] [2022-04-28 10:06:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {51092#(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); {51072#true} is VALID [2022-04-28 10:06:38,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-28 10:06:38,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-28 10:06:38,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51092#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:38,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {51092#(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); {51072#true} is VALID [2022-04-28 10:06:38,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-28 10:06:38,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-28 10:06:38,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-28 10:06:38,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51077#(= main_~y~0 0)} is VALID [2022-04-28 10:06:38,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {51077#(= 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; {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:38,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {51078#(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; {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:38,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {51079#(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; {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:38,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {51080#(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; {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:38,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {51081#(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; {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:38,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {51082#(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; {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:38,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {51083#(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; {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:38,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {51084#(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; {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:38,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {51085#(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; {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:38,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {51086#(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; {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:38,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:38,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:38,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {51088#(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; {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:38,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {51089#(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; {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:38,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {51090#(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; {51091#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:38,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {51091#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:38,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-28 10:06:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750168338] [2022-04-28 10:06:38,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750168338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528978317] [2022-04-28 10:06:38,384 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:38,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:38,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:38,385 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-28 10:06:38,387 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-28 10:06:38,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:06:38,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:38,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:06:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:38,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:38,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51072#true} is VALID [2022-04-28 10:06:38,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#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); {51072#true} is VALID [2022-04-28 10:06:38,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-28 10:06:38,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-28 10:06:38,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-28 10:06:38,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51077#(= main_~y~0 0)} is VALID [2022-04-28 10:06:38,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {51077#(= 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; {51078#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:38,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {51078#(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; {51079#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:38,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {51079#(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; {51080#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:38,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {51080#(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; {51081#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:38,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {51081#(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; {51082#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:38,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {51082#(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; {51083#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:38,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {51083#(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; {51084#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:38,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {51084#(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; {51085#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:38,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {51085#(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; {51086#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:38,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {51086#(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; {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:38,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:38,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {51087#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51088#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:38,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {51088#(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; {51089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:38,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {51089#(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; {51090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:38,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {51090#(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; {51156#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {51156#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-28 10:06:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:38,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {51073#false} assume !false; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {51073#false} assume 0 == ~cond; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {51073#false} ~cond := #in~cond; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L272 TraceCheckUtils]: 33: Hoare triple {51073#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {51073#false} assume !(~y~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {51073#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {51073#false} is VALID [2022-04-28 10:06:39,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {51250#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51073#false} is VALID [2022-04-28 10:06:39,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {51254#(< 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; {51250#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:39,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {51258#(< 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; {51254#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:39,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {51262#(< 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; {51258#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:39,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {51262#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:39,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:39,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {51273#(< 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; {51266#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:39,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {51277#(< 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; {51273#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:39,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {51281#(< 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; {51277#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:39,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {51285#(< 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; {51281#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:39,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {51289#(< 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; {51285#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:39,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {51293#(< 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; {51289#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:39,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {51297#(< 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; {51293#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:39,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {51301#(< 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; {51297#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:39,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {51305#(< 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; {51301#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:39,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {51309#(< 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; {51305#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:39,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {51072#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51309#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:39,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {51072#true} call #t~ret11 := main(); {51072#true} is VALID [2022-04-28 10:06:39,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51072#true} {51072#true} #61#return; {51072#true} is VALID [2022-04-28 10:06:39,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {51072#true} assume true; {51072#true} is VALID [2022-04-28 10:06:39,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {51072#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); {51072#true} is VALID [2022-04-28 10:06:39,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {51072#true} call ULTIMATE.init(); {51072#true} is VALID [2022-04-28 10:06:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:39,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528978317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:39,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:39,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:06:39,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:39,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642282289] [2022-04-28 10:06:39,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642282289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:39,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:39,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:06:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088427723] [2022-04-28 10:06:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:39,399 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 37 [2022-04-28 10:06:39,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:39,399 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-28 10:06:39,417 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-28 10:06:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:06:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:06:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:06:39,418 INFO L87 Difference]: Start difference. First operand 136 states and 175 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-28 10:06:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:41,081 INFO L93 Difference]: Finished difference Result 165 states and 204 transitions. [2022-04-28 10:06:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:06:41,081 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 37 [2022-04-28 10:06:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:41,081 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-28 10:06:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-28 10:06:41,082 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-28 10:06:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-28 10:06:41,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 68 transitions. [2022-04-28 10:06:41,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:41,137 INFO L225 Difference]: With dead ends: 165 [2022-04-28 10:06:41,137 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 10:06:41,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=568, Invalid=2294, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:06:41,137 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:41,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 10:06:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2022-04-28 10:06:41,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:41,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:41,537 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:41,537 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:41,538 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2022-04-28 10:06:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2022-04-28 10:06:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:41,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:41,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 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 149 states. [2022-04-28 10:06:41,539 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 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 149 states. [2022-04-28 10:06:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:41,540 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2022-04-28 10:06:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2022-04-28 10:06:41,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:41,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:41,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:41,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2022-04-28 10:06:41,542 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 37 [2022-04-28 10:06:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:41,542 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2022-04-28 10:06:41,543 INFO L496 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-28 10:06:41,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 176 transitions. [2022-04-28 10:06:41,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2022-04-28 10:06:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:06:41,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:41,861 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:41,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:42,062 WARN L477 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-28 10:06:42,062 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1886534095, now seen corresponding path program 121 times [2022-04-28 10:06:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144000266] [2022-04-28 10:06:42,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:42,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1886534095, now seen corresponding path program 122 times [2022-04-28 10:06:42,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:42,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871850360] [2022-04-28 10:06:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:42,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {52300#(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); {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:42,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {52300#(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); {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-28 10:06:42,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-28 10:06:42,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52277#(= main_~y~0 0)} is VALID [2022-04-28 10:06:42,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {52277#(= 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; {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:42,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {52278#(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; {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:42,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {52279#(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; {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:42,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {52280#(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; {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:42,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {52281#(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; {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:42,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#(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; {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:42,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {52283#(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; {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:42,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {52284#(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; {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:42,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {52285#(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; {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:42,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {52286#(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; {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:42,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {52287#(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; {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:42,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {52288#(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; {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:42,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#(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; {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:42,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {52290#(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; {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:42,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {52291#(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; {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:42,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {52292#(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; {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:42,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {52293#(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; {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:42,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {52294#(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; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:42,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {52295#(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; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:06:42,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {52296#(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; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {52298#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:06:42,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {52298#(and (<= main_~z~0 20) (<= 20 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; {52299#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {52299#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {52273#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {52273#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {52273#false} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-28 10:06:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:06:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:42,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871850360] [2022-04-28 10:06:42,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871850360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:42,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937798250] [2022-04-28 10:06:42,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:42,474 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-28 10:06:42,474 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-28 10:06:42,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:42,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:42,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:06:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:42,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:42,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52272#true} is VALID [2022-04-28 10:06:42,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#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); {52272#true} is VALID [2022-04-28 10:06:42,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-28 10:06:42,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-28 10:06:42,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-28 10:06:42,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52277#(= main_~y~0 0)} is VALID [2022-04-28 10:06:42,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {52277#(= 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; {52278#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:42,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {52278#(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; {52279#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:42,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {52279#(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; {52280#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:42,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {52280#(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; {52281#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:42,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {52281#(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; {52282#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:42,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {52282#(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; {52283#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:42,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {52283#(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; {52284#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:42,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {52284#(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; {52285#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:42,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {52285#(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; {52286#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:42,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {52286#(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; {52287#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:42,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {52287#(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; {52288#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:42,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {52288#(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; {52289#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:42,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {52289#(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; {52290#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:42,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {52290#(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; {52291#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:42,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {52291#(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; {52292#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:42,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {52292#(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; {52293#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:42,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {52293#(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; {52294#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:42,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {52294#(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; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:42,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {52295#(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; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:06:42,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {52296#(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; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~z~0 % 4294967296 > 0); {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:06:42,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {52297#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:06:42,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {52296#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:06:42,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {52295#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-28 10:06:42,870 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-28 10:06:42,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-28 10:06:42,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-28 10:06:42,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-28 10:06:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:42,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:43,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {52273#false} assume !false; {52273#false} is VALID [2022-04-28 10:06:43,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {52273#false} assume 0 == ~cond; {52273#false} is VALID [2022-04-28 10:06:43,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {52273#false} ~cond := #in~cond; {52273#false} is VALID [2022-04-28 10:06:43,620 INFO L272 TraceCheckUtils]: 33: Hoare triple {52273#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52273#false} is VALID [2022-04-28 10:06:43,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {52424#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {52273#false} is VALID [2022-04-28 10:06:43,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52424#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:43,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:43,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:43,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {52432#(< 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; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:43,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:43,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:43,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {52428#(< 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; {52432#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:43,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {52424#(< 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; {52428#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:43,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {52454#(< 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; {52424#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:43,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {52458#(< 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; {52454#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:43,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {52462#(< 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; {52458#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:43,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {52466#(< 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; {52462#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:43,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {52470#(< 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; {52466#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:43,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {52474#(< 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; {52470#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:43,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {52478#(< 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; {52474#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:43,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {52482#(< 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; {52478#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:43,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {52486#(< 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; {52482#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:43,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {52490#(< 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; {52486#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:43,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {52494#(< 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; {52490#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:06:43,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {52498#(< 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; {52494#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:06:43,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {52502#(< 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; {52498#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:06:43,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {52506#(< 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; {52502#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:06:43,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {52510#(< 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; {52506#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:06:43,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {52514#(< 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; {52510#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:06:43,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {52518#(< 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; {52514#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:06:43,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {52522#(< 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; {52518#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:06:43,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {52272#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52522#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:06:43,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {52272#true} call #t~ret11 := main(); {52272#true} is VALID [2022-04-28 10:06:43,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52272#true} {52272#true} #61#return; {52272#true} is VALID [2022-04-28 10:06:43,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {52272#true} assume true; {52272#true} is VALID [2022-04-28 10:06:43,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {52272#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); {52272#true} is VALID [2022-04-28 10:06:43,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {52272#true} call ULTIMATE.init(); {52272#true} is VALID [2022-04-28 10:06:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:06:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937798250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:43,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 47 [2022-04-28 10:06:43,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144000266] [2022-04-28 10:06:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144000266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:43,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:06:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724854527] [2022-04-28 10:06:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:43,638 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 37 [2022-04-28 10:06:43,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:43,638 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-28 10:06:43,665 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-28 10:06:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:06:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:06:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1632, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:06:43,666 INFO L87 Difference]: Start difference. First operand 137 states and 176 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-28 10:06:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,418 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2022-04-28 10:06:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:06:47,418 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 37 [2022-04-28 10:06:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:47,418 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-28 10:06:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 142 transitions. [2022-04-28 10:06:47,419 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-28 10:06:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 142 transitions. [2022-04-28 10:06:47,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 142 transitions. [2022-04-28 10:06:47,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:47,533 INFO L225 Difference]: With dead ends: 211 [2022-04-28 10:06:47,533 INFO L226 Difference]: Without dead ends: 203 [2022-04-28 10:06:47,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1135, Invalid=3835, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:06:47,534 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 115 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:47,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 159 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:06:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-28 10:06:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. [2022-04-28 10:06:47,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:47,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,951 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,951 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,953 INFO L93 Difference]: Finished difference Result 203 states and 250 transitions. [2022-04-28 10:06:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-04-28 10:06:47,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:47,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:47,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 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 203 states. [2022-04-28 10:06:47,954 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 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 203 states. [2022-04-28 10:06:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:47,955 INFO L93 Difference]: Finished difference Result 203 states and 250 transitions. [2022-04-28 10:06:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-04-28 10:06:47,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:47,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:47,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:47,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2022-04-28 10:06:47,957 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 37 [2022-04-28 10:06:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2022-04-28 10:06:47,957 INFO L496 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-28 10:06:47,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 184 transitions. [2022-04-28 10:06:48,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2022-04-28 10:06:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:06:48,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:48,271 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:48,289 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-28 10:06:48,479 WARN L477 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-28 10:06:48,479 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 123 times [2022-04-28 10:06:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:48,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687737492] [2022-04-28 10:06:48,482 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:48,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 124 times [2022-04-28 10:06:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435624557] [2022-04-28 10:06:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {53721#(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); {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {53721#(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); {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-28 10:06:48,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= 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; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:48,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= 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; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= 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; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= 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; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= 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; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:48,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= 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; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= 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; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:48,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:48,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,682 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:06:48,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {53719#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {53720#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:06:48,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {53720#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {53706#false} is VALID [2022-04-28 10:06:48,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-28 10:06:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:48,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435624557] [2022-04-28 10:06:48,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435624557] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:48,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981074522] [2022-04-28 10:06:48,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:48,684 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-28 10:06:48,685 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-28 10:06:48,727 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:48,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:48,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:06:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:48,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:48,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#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); {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:48,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= 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; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:48,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= 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; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= 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; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= 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; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= 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; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:48,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= 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; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= 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; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:48,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:49,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:49,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,005 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:49,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:49,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {53831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53706#false} is VALID [2022-04-28 10:06:49,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-28 10:06:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:49,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:49,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {53706#false} assume !false; {53706#false} is VALID [2022-04-28 10:06:49,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {53831#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53706#false} is VALID [2022-04-28 10:06:49,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53831#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:49,336 INFO L272 TraceCheckUtils]: 34: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {53827#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:49,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:49,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:49,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {53718#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {53716#(<= 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; {53717#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {53715#(<= 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; {53716#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {53714#(<= 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; {53715#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:06:49,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {53713#(<= 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; {53714#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {53712#(<= 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; {53713#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {53711#(<= 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; {53712#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:06:49,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {53710#(<= 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; {53711#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:06:49,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {53705#true} assume !(~x~0 % 4294967296 > 0); {53710#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:06:49,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {53705#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; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {53705#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {53705#true} call #t~ret11 := main(); {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53705#true} {53705#true} #61#return; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {53705#true} assume true; {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {53705#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); {53705#true} is VALID [2022-04-28 10:06:49,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {53705#true} call ULTIMATE.init(); {53705#true} is VALID [2022-04-28 10:06:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981074522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:49,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:49,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-28 10:06:49,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687737492] [2022-04-28 10:06:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687737492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:49,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:49,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:06:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517438655] [2022-04-28 10:06:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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 38 [2022-04-28 10:06:49,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:49,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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-28 10:06:49,388 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-28 10:06:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:06:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:06:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:06:49,389 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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-28 10:06:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,116 INFO L93 Difference]: Finished difference Result 395 states and 523 transitions. [2022-04-28 10:06:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:06:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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 38 [2022-04-28 10:06:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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-28 10:06:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-04-28 10:06:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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-28 10:06:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2022-04-28 10:06:52,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 62 transitions. [2022-04-28 10:06:52,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:52,176 INFO L225 Difference]: With dead ends: 395 [2022-04-28 10:06:52,176 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 10:06:52,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:06:52,176 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:52,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 92 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:06:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 10:06:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 147. [2022-04-28 10:06:52,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:52,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,614 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,614 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,621 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2022-04-28 10:06:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 508 transitions. [2022-04-28 10:06:52,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:52,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:52,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 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 381 states. [2022-04-28 10:06:52,622 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 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 381 states. [2022-04-28 10:06:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:52,629 INFO L93 Difference]: Finished difference Result 381 states and 508 transitions. [2022-04-28 10:06:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 508 transitions. [2022-04-28 10:06:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:52,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:52,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-04-28 10:06:52,632 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 38 [2022-04-28 10:06:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:52,632 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-04-28 10:06:52,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 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-28 10:06:52,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 190 transitions. [2022-04-28 10:06:52,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-04-28 10:06:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:06:52,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:52,993 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:53,008 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-28 10:06:53,193 WARN L477 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-28 10:06:53,193 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 125 times [2022-04-28 10:06:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633321325] [2022-04-28 10:06:53,195 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:53,196 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 126 times [2022-04-28 10:06:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:53,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552791596] [2022-04-28 10:06:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {55841#(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); {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:53,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {55841#(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); {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-28 10:06:53,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-28 10:06:53,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55824#(= main_~y~0 0)} is VALID [2022-04-28 10:06:53,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {55824#(= 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; {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:53,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {55825#(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; {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:53,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {55826#(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; {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:53,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {55827#(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; {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:53,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {55828#(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; {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:53,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {55829#(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; {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:53,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {55830#(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; {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:53,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {55831#(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; {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:53,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {55832#(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; {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {55834#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:53,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {55834#(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; {55835#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:53,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {55835#(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; {55836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:53,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {55836#(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; {55837#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:53,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {55837#(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; {55838#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:53,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {55838#(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; {55839#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {55839#(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; {55840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {55840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-28 10:06:53,486 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-28 10:06:53,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-28 10:06:53,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-28 10:06:53,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-28 10:06:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:53,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552791596] [2022-04-28 10:06:53,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552791596] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:53,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061068642] [2022-04-28 10:06:53,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:53,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:53,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:53,487 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-28 10:06:53,488 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-28 10:06:53,639 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:06:53,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:53,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:06:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:53,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55819#true} is VALID [2022-04-28 10:06:53,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#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); {55819#true} is VALID [2022-04-28 10:06:53,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-28 10:06:53,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-28 10:06:53,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-28 10:06:53,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55824#(= main_~y~0 0)} is VALID [2022-04-28 10:06:53,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {55824#(= 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; {55825#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:53,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {55825#(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; {55826#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:53,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {55826#(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; {55827#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:53,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {55827#(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; {55828#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:53,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {55828#(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; {55829#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:53,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {55829#(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; {55830#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:53,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {55830#(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; {55831#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:53,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {55831#(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; {55832#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:53,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {55832#(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; {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {55833#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {55893#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {55893#(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; {55897#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:53,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {55897#(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; {55901#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {55901#(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; {55905#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {55905#(and (= (+ (- 2) main_~y~0) (+ 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; {55909#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {55909#(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; {55913#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {55913#(and (= (+ main_~y~0 (- 4)) (+ 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; {55917#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:53,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {55917#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-28 10:06:53,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-28 10:06:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:06:53,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {55820#false} assume !false; {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {55820#false} assume 0 == ~cond; {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {55820#false} ~cond := #in~cond; {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L272 TraceCheckUtils]: 34: Hoare triple {55820#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {55820#false} assume !(~y~0 % 4294967296 > 0); {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:54,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {55820#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:54,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {55984#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55820#false} is VALID [2022-04-28 10:06:54,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {55988#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55984#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:54,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {55992#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55988#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:54,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {55996#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55992#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:54,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {56000#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {55996#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:54,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {56004#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {56000#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:54,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {56008#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {56004#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:54,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {56012#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {56008#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:54,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {56016#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 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; {56012#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {56020#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {56016#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {56024#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 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; {56020#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {56028#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 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; {56024#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {56032#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 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; {56028#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {56036#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 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; {56032#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {55819#true} ~z~0 := ~y~0; {56036#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {55819#true} assume !(~x~0 % 4294967296 > 0); {55819#true} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {55819#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; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {55819#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {55819#true} call #t~ret11 := main(); {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55819#true} {55819#true} #61#return; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {55819#true} assume true; {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {55819#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); {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {55819#true} call ULTIMATE.init(); {55819#true} is VALID [2022-04-28 10:06:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:06:54,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061068642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:54,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:54,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 41 [2022-04-28 10:06:54,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:54,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633321325] [2022-04-28 10:06:54,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633321325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:54,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:54,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347278564] [2022-04-28 10:06:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:54,484 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 38 [2022-04-28 10:06:54,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:54,484 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-28 10:06:54,504 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-28 10:06:54,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:06:54,504 INFO L87 Difference]: Start difference. First operand 147 states and 190 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-28 10:06:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:56,498 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-04-28 10:06:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:06:56,499 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 38 [2022-04-28 10:06:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:56,499 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-28 10:06:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 10:06:56,500 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-28 10:06:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 66 transitions. [2022-04-28 10:06:56,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 66 transitions. [2022-04-28 10:06:56,554 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-28 10:06:56,556 INFO L225 Difference]: With dead ends: 174 [2022-04-28 10:06:56,556 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 10:06:56,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=3582, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:06:56,556 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:56,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 10:06:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2022-04-28 10:06:57,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:57,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:57,008 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:57,008 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:57,010 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 10:06:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 10:06:57,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:57,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:57,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:06:57,010 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:06:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:57,011 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 10:06:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 10:06:57,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:57,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:57,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:57,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:06:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-04-28 10:06:57,013 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 38 [2022-04-28 10:06:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:57,013 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-04-28 10:06:57,014 INFO L496 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-28 10:06:57,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 191 transitions. [2022-04-28 10:06:57,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-04-28 10:06:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:06:57,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:57,378 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:57,383 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-28 10:06:57,578 WARN L477 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-28 10:06:57,578 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 127 times [2022-04-28 10:06:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636483756] [2022-04-28 10:06:57,580 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:57,580 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 128 times [2022-04-28 10:06:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:57,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662928342] [2022-04-28 10:06:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {57119#(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); {57098#true} is VALID [2022-04-28 10:06:57,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-28 10:06:57,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-28 10:06:57,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:57,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {57119#(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); {57098#true} is VALID [2022-04-28 10:06:57,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-28 10:06:57,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-28 10:06:57,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-28 10:06:57,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57103#(= main_~y~0 0)} is VALID [2022-04-28 10:06:57,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {57103#(= 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; {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:57,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {57104#(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; {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:57,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {57105#(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; {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:57,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {57106#(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; {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:57,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {57107#(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; {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:57,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {57108#(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; {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:57,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {57109#(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; {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:57,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {57110#(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; {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:57,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {57111#(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; {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:57,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {57112#(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; {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:57,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:57,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:57,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {57114#(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; {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:57,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {57115#(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; {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:57,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {57116#(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; {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:57,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {57117#(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; {57118#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:57,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {57118#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:57,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-28 10:06:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:57,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662928342] [2022-04-28 10:06:57,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662928342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:57,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426630130] [2022-04-28 10:06:57,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:57,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:57,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:57,842 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-28 10:06:57,844 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-28 10:06:57,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:57,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:57,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:06:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:58,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57098#true} is VALID [2022-04-28 10:06:58,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#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); {57098#true} is VALID [2022-04-28 10:06:58,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-28 10:06:58,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-28 10:06:58,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-28 10:06:58,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57103#(= main_~y~0 0)} is VALID [2022-04-28 10:06:58,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {57103#(= 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; {57104#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:58,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {57104#(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; {57105#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:58,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {57105#(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; {57106#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:58,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {57106#(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; {57107#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:58,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {57107#(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; {57108#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:58,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {57108#(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; {57109#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:58,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {57109#(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; {57110#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:58,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {57110#(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; {57111#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:58,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {57111#(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; {57112#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:58,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {57112#(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; {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:58,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:58,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {57113#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {57114#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:06:58,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {57114#(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; {57115#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:06:58,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {57115#(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; {57116#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:58,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {57116#(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; {57117#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:58,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {57117#(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; {57186#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {57186#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:58,177 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-28 10:06:58,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-28 10:06:58,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-28 10:06:58,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-28 10:06:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:58,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:58,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {57099#false} assume !false; {57099#false} is VALID [2022-04-28 10:06:58,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {57099#false} assume 0 == ~cond; {57099#false} is VALID [2022-04-28 10:06:58,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {57099#false} ~cond := #in~cond; {57099#false} is VALID [2022-04-28 10:06:58,621 INFO L272 TraceCheckUtils]: 34: Hoare triple {57099#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {57099#false} is VALID [2022-04-28 10:06:58,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {57099#false} assume !(~y~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:58,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {57099#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {57099#false} is VALID [2022-04-28 10:06:58,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {57280#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {57099#false} is VALID [2022-04-28 10:06:58,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {57284#(< 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; {57280#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:58,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {57288#(< 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; {57284#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:58,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {57292#(< 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; {57288#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:58,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {57296#(< 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; {57292#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:58,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {57296#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:06:58,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:58,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {57307#(< 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; {57300#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:58,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {57311#(< 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; {57307#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:58,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {57315#(< 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; {57311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:58,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {57319#(< 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; {57315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:58,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {57323#(< 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; {57319#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:58,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {57327#(< 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; {57323#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:58,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {57331#(< 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; {57327#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:58,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {57335#(< 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; {57331#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:58,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {57339#(< 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; {57335#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:58,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {57343#(< 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; {57339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:58,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {57098#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57343#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:58,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {57098#true} call #t~ret11 := main(); {57098#true} is VALID [2022-04-28 10:06:58,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57098#true} {57098#true} #61#return; {57098#true} is VALID [2022-04-28 10:06:58,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {57098#true} assume true; {57098#true} is VALID [2022-04-28 10:06:58,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {57098#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); {57098#true} is VALID [2022-04-28 10:06:58,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {57098#true} call ULTIMATE.init(); {57098#true} is VALID [2022-04-28 10:06:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:06:58,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426630130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:58,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:58,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:06:58,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:58,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636483756] [2022-04-28 10:06:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636483756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:58,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:58,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135161818] [2022-04-28 10:06:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:58,634 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 38 [2022-04-28 10:06:58,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:58,634 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-28 10:06:58,654 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-28 10:06:58,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:06:58,655 INFO L87 Difference]: Start difference. First operand 148 states and 191 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-28 10:07:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,387 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2022-04-28 10:07:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:07:00,387 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 38 [2022-04-28 10:07:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:00,388 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-28 10:07:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 10:07:00,388 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-28 10:07:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2022-04-28 10:07:00,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2022-04-28 10:07:00,443 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-28 10:07:00,445 INFO L225 Difference]: With dead ends: 177 [2022-04-28 10:07:00,445 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 10:07:00,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=2760, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:07:00,445 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:00,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 10:07:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2022-04-28 10:07:00,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:00,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:00,887 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:00,887 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,889 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 10:07:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 10:07:00,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:00,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:00,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:07:00,889 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:07:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,890 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 10:07:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 10:07:00,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:00,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:00,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:00,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2022-04-28 10:07:00,892 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 38 [2022-04-28 10:07:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:00,892 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2022-04-28 10:07:00,892 INFO L496 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-28 10:07:00,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 192 transitions. [2022-04-28 10:07:01,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2022-04-28 10:07:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:07:01,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:01,261 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:01,278 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-28 10:07:01,467 WARN L477 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-28 10:07:01,467 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 129 times [2022-04-28 10:07:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864181835] [2022-04-28 10:07:01,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:01,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 130 times [2022-04-28 10:07:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:01,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696331156] [2022-04-28 10:07:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {58404#(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); {58384#true} is VALID [2022-04-28 10:07:01,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-28 10:07:01,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-28 10:07:01,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:01,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {58404#(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); {58384#true} is VALID [2022-04-28 10:07:01,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-28 10:07:01,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-28 10:07:01,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-28 10:07:01,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58389#(= main_~y~0 0)} is VALID [2022-04-28 10:07:01,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {58389#(= 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; {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:01,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {58390#(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; {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:01,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(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; {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:01,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {58392#(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; {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:01,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {58393#(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; {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:01,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {58394#(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; {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:01,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {58395#(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; {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:01,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {58396#(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; {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:01,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {58397#(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; {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:01,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {58398#(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; {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:01,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {58399#(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; {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:01,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:01,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:01,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {58401#(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; {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:01,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {58402#(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; {58403#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {58403#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-28 10:07:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:01,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696331156] [2022-04-28 10:07:01,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696331156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:01,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503594681] [2022-04-28 10:07:01,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:01,755 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-28 10:07:01,756 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-28 10:07:01,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:01,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:01,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:07:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:01,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:02,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58384#true} is VALID [2022-04-28 10:07:02,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#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); {58384#true} is VALID [2022-04-28 10:07:02,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-28 10:07:02,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-28 10:07:02,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-28 10:07:02,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58389#(= main_~y~0 0)} is VALID [2022-04-28 10:07:02,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {58389#(= 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; {58390#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:02,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {58390#(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; {58391#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:02,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {58391#(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; {58392#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:02,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {58392#(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; {58393#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:02,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {58393#(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; {58394#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:02,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {58394#(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; {58395#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:02,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {58395#(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; {58396#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:02,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {58396#(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; {58397#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:02,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {58397#(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; {58398#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:02,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {58398#(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; {58399#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:02,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {58399#(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; {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:02,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:02,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {58400#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {58401#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:02,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {58401#(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; {58402#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {58402#(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; {58468#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {58468#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-28 10:07:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:02,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {58385#false} assume !false; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {58385#false} assume 0 == ~cond; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {58385#false} ~cond := #in~cond; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L272 TraceCheckUtils]: 34: Hoare triple {58385#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {58385#false} assume !(~y~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {58385#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {58385#false} is VALID [2022-04-28 10:07:02,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {58568#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58385#false} is VALID [2022-04-28 10:07:02,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {58572#(< 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; {58568#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:02,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {58576#(< 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; {58572#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:02,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {58576#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:02,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:02,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {58587#(< 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; {58580#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:02,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {58591#(< 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; {58587#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:02,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {58595#(< 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; {58591#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:02,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {58599#(< 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; {58595#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:02,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {58603#(< 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; {58599#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:02,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {58607#(< 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; {58603#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:02,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {58611#(< 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; {58607#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:02,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {58615#(< 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; {58611#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:02,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {58619#(< 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; {58615#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:02,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {58623#(< 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; {58619#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:02,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {58627#(< 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; {58623#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:02,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {58384#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58627#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:02,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {58384#true} call #t~ret11 := main(); {58384#true} is VALID [2022-04-28 10:07:02,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58384#true} {58384#true} #61#return; {58384#true} is VALID [2022-04-28 10:07:02,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {58384#true} assume true; {58384#true} is VALID [2022-04-28 10:07:02,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {58384#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); {58384#true} is VALID [2022-04-28 10:07:02,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {58384#true} call ULTIMATE.init(); {58384#true} is VALID [2022-04-28 10:07:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:02,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503594681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:02,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:02,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:07:02,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:02,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864181835] [2022-04-28 10:07:02,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864181835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:02,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:02,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:07:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582002877] [2022-04-28 10:07:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:02,552 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 38 [2022-04-28 10:07:02,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:02,552 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-28 10:07:02,569 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-28 10:07:02,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:07:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:07:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:07:02,570 INFO L87 Difference]: Start difference. First operand 149 states and 192 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-28 10:07:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,318 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2022-04-28 10:07:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:04,318 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 38 [2022-04-28 10:07:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:04,318 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-28 10:07:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-28 10:07:04,319 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-28 10:07:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-28 10:07:04,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 71 transitions. [2022-04-28 10:07:04,374 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-28 10:07:04,376 INFO L225 Difference]: With dead ends: 180 [2022-04-28 10:07:04,376 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 10:07:04,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:07:04,376 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:04,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 98 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 10:07:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2022-04-28 10:07:04,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:04,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,821 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,821 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,822 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-28 10:07:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-04-28 10:07:04,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 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 163 states. [2022-04-28 10:07:04,823 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 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 163 states. [2022-04-28 10:07:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:04,824 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2022-04-28 10:07:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-04-28 10:07:04,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:04,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:04,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:04,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.303448275862069) internal successors, (189), 145 states have internal predecessors, (189), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2022-04-28 10:07:04,826 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 38 [2022-04-28 10:07:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:04,826 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2022-04-28 10:07:04,826 INFO L496 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-28 10:07:04,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 193 transitions. [2022-04-28 10:07:05,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2022-04-28 10:07:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:07:05,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:05,193 INFO L195 NwaCegarLoop]: trace histogram [21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:05,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-04-28 10:07:05,393 WARN L477 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-28 10:07:05,393 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2104430926, now seen corresponding path program 131 times [2022-04-28 10:07:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:05,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677720397] [2022-04-28 10:07:05,403 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:05,403 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2104430926, now seen corresponding path program 132 times [2022-04-28 10:07:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:05,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658511751] [2022-04-28 10:07:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {59699#(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); {59670#true} is VALID [2022-04-28 10:07:05,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-28 10:07:05,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-28 10:07:05,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59699#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:05,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {59699#(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); {59670#true} is VALID [2022-04-28 10:07:05,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-28 10:07:05,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-28 10:07:05,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-28 10:07:05,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59675#(= main_~y~0 0)} is VALID [2022-04-28 10:07:05,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {59675#(= 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; {59676#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:05,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {59676#(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; {59677#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:05,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {59677#(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; {59678#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:05,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {59678#(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; {59679#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:05,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {59679#(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; {59680#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:05,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {59680#(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; {59681#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:05,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {59681#(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; {59682#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:05,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {59682#(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; {59683#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:05,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {59683#(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; {59684#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:05,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {59684#(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; {59685#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:05,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {59685#(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; {59686#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:05,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {59686#(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; {59687#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:05,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {59687#(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; {59688#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:05,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {59688#(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; {59689#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:05,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {59689#(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; {59690#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:05,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {59690#(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; {59691#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:05,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {59691#(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; {59692#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:05,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {59692#(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; {59693#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:05,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {59693#(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; {59694#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:07:05,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {59694#(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; {59695#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:07:05,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {59695#(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; {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:05,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:05,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {59696#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {59697#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:07:05,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {59697#(and (<= main_~z~0 21) (<= 21 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; {59698#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {59698#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {59671#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {59671#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-28 10:07:05,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-28 10:07:05,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-28 10:07:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658511751] [2022-04-28 10:07:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658511751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:05,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951889454] [2022-04-28 10:07:05,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:05,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:05,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:05,864 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-28 10:07:05,865 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-28 10:07:05,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:07:05,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:05,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:07:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:06,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59670#true} is VALID [2022-04-28 10:07:06,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#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); {59670#true} is VALID [2022-04-28 10:07:06,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-28 10:07:06,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-28 10:07:06,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {59670#true} assume !(~x~0 % 4294967296 > 0); {59670#true} is VALID [2022-04-28 10:07:06,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {59670#true} ~z~0 := ~y~0; {59787#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:07:06,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {59787#(= 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; {59791#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:07:06,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {59791#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59799#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {59799#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-28 10:07:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 10:07:06,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:06,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {59671#false} assume !false; {59671#false} is VALID [2022-04-28 10:07:06,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {59671#false} assume 0 == ~cond; {59671#false} is VALID [2022-04-28 10:07:06,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {59671#false} ~cond := #in~cond; {59671#false} is VALID [2022-04-28 10:07:06,214 INFO L272 TraceCheckUtils]: 34: Hoare triple {59671#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {59671#false} is VALID [2022-04-28 10:07:06,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {59671#false} assume !(~y~0 % 4294967296 > 0); {59671#false} is VALID [2022-04-28 10:07:06,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {59799#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59671#false} is VALID [2022-04-28 10:07:06,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {59799#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:06,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {59839#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {59795#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:06,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {59843#(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; {59839#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:07:06,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {59670#true} ~z~0 := ~y~0; {59843#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {59670#true} assume !(~x~0 % 4294967296 > 0); {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {59670#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; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {59670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {59670#true} call #t~ret11 := main(); {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59670#true} {59670#true} #61#return; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {59670#true} assume true; {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {59670#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); {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {59670#true} call ULTIMATE.init(); {59670#true} is VALID [2022-04-28 10:07:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-04-28 10:07:06,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951889454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:06,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:06,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 6, 6] total 33 [2022-04-28 10:07:06,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:06,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677720397] [2022-04-28 10:07:06,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677720397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:06,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:06,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:07:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772095807] [2022-04-28 10:07:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:06,220 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 38 [2022-04-28 10:07:06,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:06,220 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-28 10:07:06,242 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-28 10:07:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:07:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:07:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:07:06,243 INFO L87 Difference]: Start difference. First operand 150 states and 193 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-28 10:07:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:10,437 INFO L93 Difference]: Finished difference Result 235 states and 337 transitions. [2022-04-28 10:07:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:07:10,437 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 38 [2022-04-28 10:07:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:10,437 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-28 10:07:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 149 transitions. [2022-04-28 10:07:10,438 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-28 10:07:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 149 transitions. [2022-04-28 10:07:10,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 149 transitions. [2022-04-28 10:07:10,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:10,556 INFO L225 Difference]: With dead ends: 235 [2022-04-28 10:07:10,556 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 10:07:10,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=3111, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:07:10,557 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 123 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 167 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:07:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 10:07:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-04-28 10:07:11,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:11,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:11,015 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:11,015 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:11,017 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-04-28 10:07:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-04-28 10:07:11,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:11,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:11,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 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 227 states. [2022-04-28 10:07:11,018 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 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 227 states. [2022-04-28 10:07:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:11,020 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-04-28 10:07:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-04-28 10:07:11,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:11,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:11,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:11,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2022-04-28 10:07:11,021 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 38 [2022-04-28 10:07:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:11,022 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2022-04-28 10:07:11,022 INFO L496 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-28 10:07:11,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 201 transitions. [2022-04-28 10:07:11,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-28 10:07:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:07:11,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:11,397 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:11,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 10:07:11,597 WARN L477 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-28 10:07:11,597 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 638163759, now seen corresponding path program 133 times [2022-04-28 10:07:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:11,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639531667] [2022-04-28 10:07:11,600 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:11,600 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 638163759, now seen corresponding path program 134 times [2022-04-28 10:07:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:11,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236169235] [2022-04-28 10:07:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {61242#(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); {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:11,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {61242#(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); {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-28 10:07:11,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-28 10:07:11,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61224#(= main_~y~0 0)} is VALID [2022-04-28 10:07:11,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {61224#(= 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; {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:11,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {61225#(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; {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:11,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {61226#(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; {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:11,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {61227#(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; {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:11,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {61228#(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; {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:11,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {61229#(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; {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:11,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {61230#(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; {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:11,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {61231#(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; {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:11,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:11,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {61233#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:11,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {61233#(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; {61234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:11,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {61234#(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; {61235#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:11,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {61235#(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; {61236#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:11,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {61236#(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; {61237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:11,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {61237#(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; {61238#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:11,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {61238#(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; {61239#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:11,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {61239#(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; {61240#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:11,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {61240#(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; {61241#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {61241#(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; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#false} assume !(~z~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#false} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-28 10:07:11,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-28 10:07:11,884 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-28 10:07:11,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236169235] [2022-04-28 10:07:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236169235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923630523] [2022-04-28 10:07:11,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:11,886 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-28 10:07:11,886 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-28 10:07:11,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:11,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:11,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 10:07:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:12,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61219#true} is VALID [2022-04-28 10:07:12,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#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); {61219#true} is VALID [2022-04-28 10:07:12,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-28 10:07:12,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-28 10:07:12,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-28 10:07:12,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61224#(= main_~y~0 0)} is VALID [2022-04-28 10:07:12,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {61224#(= 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; {61225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:12,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {61225#(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; {61226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:12,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {61226#(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; {61227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:12,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {61227#(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; {61228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:12,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {61228#(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; {61229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:12,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {61229#(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; {61230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:12,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {61230#(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; {61231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:12,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {61231#(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; {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {61232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {61291#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {61291#(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; {61295#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:12,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {61295#(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; {61299#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {61299#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 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; {61303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {61303#(and (= (+ (- 2) main_~y~0) (+ 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; {61307#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:07:12,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {61307#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61311#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {61311#(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; {61315#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {61315#(and (= (+ main_~y~0 (- 4)) (+ 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; {61319#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {61319#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 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; {61323#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {61323#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 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; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#false} assume !(~z~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#false} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-28 10:07:12,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-28 10:07:12,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-28 10:07:12,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-28 10:07:12,353 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-28 10:07:12,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:12,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#false} assume !false; {61220#false} is VALID [2022-04-28 10:07:12,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#false} assume 0 == ~cond; {61220#false} is VALID [2022-04-28 10:07:12,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#false} ~cond := #in~cond; {61220#false} is VALID [2022-04-28 10:07:12,989 INFO L272 TraceCheckUtils]: 35: Hoare triple {61220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61220#false} is VALID [2022-04-28 10:07:12,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {61381#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {61220#false} is VALID [2022-04-28 10:07:12,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {61385#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61381#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:12,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {61389#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61385#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:12,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {61393#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61389#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:12,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {61397#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61393#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:12,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {61401#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61397#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:12,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {61405#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61401#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:12,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {61409#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61405#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:12,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {61409#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:07:12,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:12,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {61420#(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; {61413#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:12,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {61424#(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; {61420#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:12,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {61428#(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; {61424#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:12,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {61432#(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; {61428#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:12,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {61436#(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; {61432#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:13,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {61440#(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; {61436#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:13,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {61444#(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; {61440#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:07:13,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {61448#(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; {61444#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:13,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {61452#(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; {61448#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {61219#true} ~z~0 := ~y~0; {61452#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {61219#true} assume !(~x~0 % 4294967296 > 0); {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {61219#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; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {61219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {61219#true} call #t~ret11 := main(); {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61219#true} {61219#true} #61#return; {61219#true} is VALID [2022-04-28 10:07:13,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {61219#true} assume true; {61219#true} is VALID [2022-04-28 10:07:13,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {61219#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); {61219#true} is VALID [2022-04-28 10:07:13,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {61219#true} call ULTIMATE.init(); {61219#true} is VALID [2022-04-28 10:07:13,005 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-28 10:07:13,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923630523] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:13,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:13,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 48 [2022-04-28 10:07:13,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:13,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639531667] [2022-04-28 10:07:13,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639531667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:13,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:13,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637640155] [2022-04-28 10:07:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:13,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:13,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:13,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-28 10:07:13,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:07:13,026 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:14,467 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-28 10:07:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 45 transitions. [2022-04-28 10:07:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 45 transitions. [2022-04-28 10:07:14,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 45 transitions. [2022-04-28 10:07:14,500 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-28 10:07:14,501 INFO L225 Difference]: With dead ends: 170 [2022-04-28 10:07:14,501 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 10:07:14,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=678, Invalid=3612, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:07:14,502 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:14,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:07:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 10:07:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-04-28 10:07:14,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:14,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:14,915 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:14,915 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:14,917 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2022-04-28 10:07:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-28 10:07:14,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:14,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:14,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 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 145 states. [2022-04-28 10:07:14,917 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 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 145 states. [2022-04-28 10:07:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:14,918 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2022-04-28 10:07:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-28 10:07:14,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:14,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:14,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:14,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 140 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2022-04-28 10:07:14,920 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 39 [2022-04-28 10:07:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:14,920 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2022-04-28 10:07:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 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-28 10:07:14,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 188 transitions. [2022-04-28 10:07:15,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:15,263 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2022-04-28 10:07:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:07:15,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:15,263 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:15,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-28 10:07:15,464 WARN L477 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-28 10:07:15,464 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 135 times [2022-04-28 10:07:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:15,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724505105] [2022-04-28 10:07:15,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:15,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 136 times [2022-04-28 10:07:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:15,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398816054] [2022-04-28 10:07:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:15,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {62482#(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); {62459#true} is VALID [2022-04-28 10:07:15,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-28 10:07:15,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-28 10:07:15,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:15,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {62482#(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); {62459#true} is VALID [2022-04-28 10:07:15,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-28 10:07:15,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-28 10:07:15,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-28 10:07:15,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62464#(= main_~y~0 0)} is VALID [2022-04-28 10:07:15,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {62464#(= 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; {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:15,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {62465#(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; {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:15,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {62466#(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; {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:15,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {62467#(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; {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:15,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {62468#(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; {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:15,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {62469#(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; {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:15,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {62470#(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; {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:15,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {62471#(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; {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:15,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {62472#(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; {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:15,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:15,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {62474#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:15,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {62474#(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; {62475#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:15,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {62475#(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; {62476#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:15,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(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; {62477#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:15,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(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; {62478#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:15,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {62478#(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; {62479#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:15,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {62479#(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; {62480#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {62480#(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; {62481#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {62481#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-28 10:07:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:07:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:15,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398816054] [2022-04-28 10:07:15,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398816054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:15,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357386567] [2022-04-28 10:07:15,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:15,745 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-28 10:07:15,747 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-28 10:07:15,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:15,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 10:07:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:15,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:16,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62459#true} is VALID [2022-04-28 10:07:16,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#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); {62459#true} is VALID [2022-04-28 10:07:16,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-28 10:07:16,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-28 10:07:16,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-28 10:07:16,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62464#(= main_~y~0 0)} is VALID [2022-04-28 10:07:16,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {62464#(= 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; {62465#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:16,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {62465#(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; {62466#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:16,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {62466#(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; {62467#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:16,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {62467#(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; {62468#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:16,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {62468#(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; {62469#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:16,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {62469#(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; {62470#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:16,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {62470#(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; {62471#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:16,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {62471#(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; {62472#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:16,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {62472#(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; {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {62473#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {62534#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {62534#(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; {62538#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:16,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {62538#(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; {62542#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {62542#(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; {62546#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {62546#(and (= (+ (- 2) main_~y~0) (+ 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; {62550#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {62550#(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; {62554#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {62554#(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; {62558#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {62558#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 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; {62562#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {62562#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-28 10:07:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:07:16,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:16,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {62460#false} assume !false; {62460#false} is VALID [2022-04-28 10:07:16,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {62460#false} assume 0 == ~cond; {62460#false} is VALID [2022-04-28 10:07:16,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {62460#false} ~cond := #in~cond; {62460#false} is VALID [2022-04-28 10:07:16,720 INFO L272 TraceCheckUtils]: 35: Hoare triple {62460#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {62460#false} is VALID [2022-04-28 10:07:16,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {62460#false} assume !(~y~0 % 4294967296 > 0); {62460#false} is VALID [2022-04-28 10:07:16,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {62460#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {62626#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62460#false} is VALID [2022-04-28 10:07:16,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {62630#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62626#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:16,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {62634#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62630#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:16,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {62638#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62634#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:16,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {62642#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62638#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:16,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {62646#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62642#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:16,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {62650#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62646#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:16,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {62654#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {62650#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:16,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {62658#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {62654#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:07:16,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {62662#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {62658#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:07:16,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {62666#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {62662#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:16,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {62670#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {62666#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:16,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {62674#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {62670#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:16,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {62678#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {62674#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:16,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {62682#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {62678#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:16,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {62686#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {62682#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {62459#true} ~z~0 := ~y~0; {62686#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {62459#true} assume !(~x~0 % 4294967296 > 0); {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {62459#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; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {62459#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {62459#true} call #t~ret11 := main(); {62459#true} is VALID [2022-04-28 10:07:16,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62459#true} {62459#true} #61#return; {62459#true} is VALID [2022-04-28 10:07:16,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {62459#true} assume true; {62459#true} is VALID [2022-04-28 10:07:16,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {62459#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); {62459#true} is VALID [2022-04-28 10:07:16,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {62459#true} call ULTIMATE.init(); {62459#true} is VALID [2022-04-28 10:07:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:07:16,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357386567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:16,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 45 [2022-04-28 10:07:16,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:16,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724505105] [2022-04-28 10:07:16,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724505105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:16,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626495578] [2022-04-28 10:07:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:16,734 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 39 [2022-04-28 10:07:16,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:16,734 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-28 10:07:16,754 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-28 10:07:16,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:07:16,754 INFO L87 Difference]: Start difference. First operand 145 states and 188 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-28 10:07:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:18,436 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2022-04-28 10:07:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:07:18,436 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 39 [2022-04-28 10:07:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:18,436 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-28 10:07:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-28 10:07:18,437 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-28 10:07:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-28 10:07:18,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 57 transitions. [2022-04-28 10:07:18,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:18,482 INFO L225 Difference]: With dead ends: 172 [2022-04-28 10:07:18,482 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 10:07:18,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:07:18,482 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:18,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 10:07:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2022-04-28 10:07:18,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:18,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:18,924 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:18,924 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:18,926 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-04-28 10:07:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 200 transitions. [2022-04-28 10:07:18,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:18,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:18,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 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 157 states. [2022-04-28 10:07:18,926 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 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 157 states. [2022-04-28 10:07:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:18,927 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-04-28 10:07:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 200 transitions. [2022-04-28 10:07:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:18,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:18,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:18,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2022-04-28 10:07:18,929 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 39 [2022-04-28 10:07:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:18,929 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2022-04-28 10:07:18,929 INFO L496 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-28 10:07:18,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 189 transitions. [2022-04-28 10:07:19,271 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-28 10:07:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2022-04-28 10:07:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:07:19,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:19,272 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:19,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-04-28 10:07:19,472 WARN L477 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-28 10:07:19,473 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 137 times [2022-04-28 10:07:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:19,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341912345] [2022-04-28 10:07:19,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:19,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 138 times [2022-04-28 10:07:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:19,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265936844] [2022-04-28 10:07:19,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:19,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {63748#(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); {63726#true} is VALID [2022-04-28 10:07:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-28 10:07:19,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-28 10:07:19,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {63748#(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); {63726#true} is VALID [2022-04-28 10:07:19,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-28 10:07:19,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-28 10:07:19,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-28 10:07:19,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63731#(= main_~y~0 0)} is VALID [2022-04-28 10:07:19,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {63731#(= 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; {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:19,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {63732#(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; {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {63733#(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; {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:19,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {63734#(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; {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:19,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {63735#(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; {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {63736#(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; {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:19,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {63737#(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; {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:19,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {63738#(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; {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {63739#(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; {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:19,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {63740#(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; {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:19,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:19,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:19,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {63742#(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; {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:19,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {63743#(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; {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:19,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {63744#(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; {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:19,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {63745#(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; {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {63746#(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; {63747#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {63747#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-28 10:07:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:19,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265936844] [2022-04-28 10:07:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265936844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029313655] [2022-04-28 10:07:19,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:19,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:19,742 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-28 10:07:19,743 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-28 10:07:19,878 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:07:19,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:19,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:07:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:19,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:20,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63726#true} is VALID [2022-04-28 10:07:20,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#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); {63726#true} is VALID [2022-04-28 10:07:20,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-28 10:07:20,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-28 10:07:20,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-28 10:07:20,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63731#(= main_~y~0 0)} is VALID [2022-04-28 10:07:20,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {63731#(= 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; {63732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:20,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {63732#(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; {63733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:20,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {63733#(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; {63734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:20,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {63734#(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; {63735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:20,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {63735#(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; {63736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:20,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {63736#(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; {63737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:20,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {63737#(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; {63738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:20,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {63738#(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; {63739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:20,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {63739#(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; {63740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:20,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {63740#(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; {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:20,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:20,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {63741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {63742#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:20,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {63742#(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; {63743#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:20,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {63743#(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; {63744#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:20,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {63744#(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; {63745#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:20,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {63745#(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; {63746#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:20,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {63746#(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; {63818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:20,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {63818#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:20,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-28 10:07:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:20,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:20,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {63727#false} assume !false; {63727#false} is VALID [2022-04-28 10:07:20,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {63727#false} assume 0 == ~cond; {63727#false} is VALID [2022-04-28 10:07:20,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {63727#false} ~cond := #in~cond; {63727#false} is VALID [2022-04-28 10:07:20,648 INFO L272 TraceCheckUtils]: 35: Hoare triple {63727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63727#false} is VALID [2022-04-28 10:07:20,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {63727#false} assume !(~y~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {63727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {63727#false} is VALID [2022-04-28 10:07:20,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {63912#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {63727#false} is VALID [2022-04-28 10:07:20,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {63916#(< 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; {63912#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:20,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {63920#(< 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; {63916#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:20,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {63924#(< 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; {63920#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:20,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {63928#(< 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; {63924#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:20,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {63932#(< 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; {63928#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:20,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {63932#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:20,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:20,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {63943#(< 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; {63936#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:20,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {63947#(< 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; {63943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:20,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {63951#(< 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; {63947#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:20,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {63955#(< 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; {63951#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:20,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {63959#(< 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; {63955#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:20,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {63963#(< 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; {63959#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:20,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {63967#(< 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; {63963#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:20,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {63971#(< 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; {63967#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:20,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {63975#(< 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; {63971#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:20,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {63979#(< 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; {63975#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:20,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {63726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63979#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:20,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {63726#true} call #t~ret11 := main(); {63726#true} is VALID [2022-04-28 10:07:20,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63726#true} {63726#true} #61#return; {63726#true} is VALID [2022-04-28 10:07:20,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {63726#true} assume true; {63726#true} is VALID [2022-04-28 10:07:20,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {63726#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); {63726#true} is VALID [2022-04-28 10:07:20,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {63726#true} call ULTIMATE.init(); {63726#true} is VALID [2022-04-28 10:07:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:20,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029313655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:20,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:20,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:07:20,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:20,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341912345] [2022-04-28 10:07:20,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341912345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:20,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:20,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:07:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841743269] [2022-04-28 10:07:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:20,661 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 39 [2022-04-28 10:07:20,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:20,662 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-28 10:07:20,687 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-28 10:07:20,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:07:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:20,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:07:20,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:07:20,687 INFO L87 Difference]: Start difference. First operand 146 states and 189 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-28 10:07:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:22,491 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2022-04-28 10:07:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:07:22,491 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 39 [2022-04-28 10:07:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:22,491 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-28 10:07:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-28 10:07:22,491 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-28 10:07:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-28 10:07:22,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2022-04-28 10:07:22,543 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-28 10:07:22,544 INFO L225 Difference]: With dead ends: 175 [2022-04-28 10:07:22,545 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 10:07:22,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=662, Invalid=2878, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:07:22,545 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:22,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 10:07:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2022-04-28 10:07:22,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:22,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,981 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,981 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:22,983 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 10:07:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 10:07:22,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:22,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:22,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:07:22,983 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 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 159 states. [2022-04-28 10:07:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:22,984 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-04-28 10:07:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2022-04-28 10:07:22,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:22,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:22,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:22,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-04-28 10:07:22,986 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 39 [2022-04-28 10:07:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:22,986 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-04-28 10:07:22,986 INFO L496 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-28 10:07:22,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 190 transitions. [2022-04-28 10:07:23,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-04-28 10:07:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:07:23,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:23,334 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:23,350 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-28 10:07:23,534 WARN L477 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-28 10:07:23,534 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 139 times [2022-04-28 10:07:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:23,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115483571] [2022-04-28 10:07:23,537 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:23,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 140 times [2022-04-28 10:07:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:23,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864218951] [2022-04-28 10:07:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {65027#(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); {65006#true} is VALID [2022-04-28 10:07:23,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-28 10:07:23,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-28 10:07:23,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:23,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {65027#(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); {65006#true} is VALID [2022-04-28 10:07:23,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-28 10:07:23,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-28 10:07:23,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-28 10:07:23,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65011#(= main_~y~0 0)} is VALID [2022-04-28 10:07:23,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {65011#(= 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; {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:23,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {65012#(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; {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:23,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#(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; {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:23,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {65014#(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; {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:23,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {65015#(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; {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:23,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {65016#(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; {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:23,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {65017#(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; {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:23,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {65018#(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; {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:23,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {65019#(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; {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:23,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {65020#(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; {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:23,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {65021#(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; {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:23,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:23,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:23,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {65023#(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; {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:23,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {65024#(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; {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {65025#(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; {65026#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {65026#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-28 10:07:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:23,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864218951] [2022-04-28 10:07:23,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864218951] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:23,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027863577] [2022-04-28 10:07:23,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:23,786 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-28 10:07:23,787 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-28 10:07:23,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:23,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:23,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:07:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:23,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:24,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65006#true} is VALID [2022-04-28 10:07:24,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#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); {65006#true} is VALID [2022-04-28 10:07:24,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-28 10:07:24,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-28 10:07:24,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-28 10:07:24,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65011#(= main_~y~0 0)} is VALID [2022-04-28 10:07:24,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {65011#(= 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; {65012#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:24,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {65012#(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; {65013#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:24,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {65013#(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; {65014#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:24,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {65014#(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; {65015#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:24,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {65015#(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; {65016#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:24,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {65016#(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; {65017#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:24,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {65017#(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; {65018#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:24,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {65018#(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; {65019#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:24,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {65019#(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; {65020#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:24,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {65020#(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; {65021#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:24,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {65021#(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; {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:24,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:24,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {65022#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65023#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:24,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {65023#(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; {65024#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:24,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {65024#(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; {65025#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:24,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {65025#(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; {65094#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:24,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {65094#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:24,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-28 10:07:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:24,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {65007#false} assume !false; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {65007#false} assume 0 == ~cond; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {65007#false} ~cond := #in~cond; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L272 TraceCheckUtils]: 35: Hoare triple {65007#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {65007#false} assume !(~y~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {65007#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {65007#false} is VALID [2022-04-28 10:07:24,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {65194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65007#false} is VALID [2022-04-28 10:07:24,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {65198#(< 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; {65194#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:24,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {65202#(< 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; {65198#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:24,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {65206#(< 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; {65202#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:24,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {65206#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:24,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:24,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {65217#(< 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; {65210#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:24,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {65221#(< 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; {65217#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:24,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {65225#(< 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; {65221#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:24,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {65229#(< 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; {65225#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:24,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {65233#(< 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; {65229#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:24,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {65237#(< 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; {65233#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:24,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {65241#(< 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; {65237#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:24,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {65245#(< 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; {65241#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:24,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {65249#(< 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; {65245#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:24,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {65253#(< 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; {65249#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:24,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {65257#(< 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; {65253#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:24,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {65006#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65257#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:24,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {65006#true} call #t~ret11 := main(); {65006#true} is VALID [2022-04-28 10:07:24,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65006#true} {65006#true} #61#return; {65006#true} is VALID [2022-04-28 10:07:24,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {65006#true} assume true; {65006#true} is VALID [2022-04-28 10:07:24,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {65006#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); {65006#true} is VALID [2022-04-28 10:07:24,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {65006#true} call ULTIMATE.init(); {65006#true} is VALID [2022-04-28 10:07:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:24,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027863577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:24,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:24,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:07:24,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115483571] [2022-04-28 10:07:24,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115483571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:24,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:24,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:07:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753823885] [2022-04-28 10:07:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:24,571 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 39 [2022-04-28 10:07:24,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:24,571 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-28 10:07:24,590 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-28 10:07:24,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:07:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:07:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:07:24,591 INFO L87 Difference]: Start difference. First operand 147 states and 190 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-28 10:07:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:26,357 INFO L93 Difference]: Finished difference Result 178 states and 221 transitions. [2022-04-28 10:07:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:07:26,357 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 39 [2022-04-28 10:07:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:26,357 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-28 10:07:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-28 10:07:26,357 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-28 10:07:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-28 10:07:26,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 70 transitions. [2022-04-28 10:07:26,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:26,413 INFO L225 Difference]: With dead ends: 178 [2022-04-28 10:07:26,413 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 10:07:26,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=631, Invalid=2561, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:07:26,414 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:26,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:07:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 10:07:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2022-04-28 10:07:26,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:26,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:26,844 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:26,844 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:26,846 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 10:07:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 10:07:26,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:26,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:26,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:07:26,846 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 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 161 states. [2022-04-28 10:07:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:26,848 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2022-04-28 10:07:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2022-04-28 10:07:26,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:26,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:26,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:26,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 143 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2022-04-28 10:07:26,849 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 39 [2022-04-28 10:07:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:26,849 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2022-04-28 10:07:26,849 INFO L496 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-28 10:07:26,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 191 transitions. [2022-04-28 10:07:27,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2022-04-28 10:07:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:07:27,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:27,206 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:27,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-28 10:07:27,406 WARN L477 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-28 10:07:27,406 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash 269298095, now seen corresponding path program 141 times [2022-04-28 10:07:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:27,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589116149] [2022-04-28 10:07:27,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:27,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash 269298095, now seen corresponding path program 142 times [2022-04-28 10:07:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:27,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144040321] [2022-04-28 10:07:27,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {66324#(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); {66294#true} is VALID [2022-04-28 10:07:27,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-28 10:07:27,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-28 10:07:27,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:27,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {66324#(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); {66294#true} is VALID [2022-04-28 10:07:27,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-28 10:07:27,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-28 10:07:27,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-28 10:07:27,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66299#(= main_~y~0 0)} is VALID [2022-04-28 10:07:27,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {66299#(= 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; {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:27,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {66300#(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; {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:27,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {66301#(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; {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:27,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {66302#(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; {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:27,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {66303#(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; {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:27,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {66304#(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; {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:27,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {66305#(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; {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:27,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {66306#(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; {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:27,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {66307#(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; {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:27,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {66308#(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; {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:27,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {66309#(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; {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:27,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {66310#(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; {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:27,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {66311#(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; {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:27,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {66312#(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; {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:27,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {66313#(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; {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:27,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {66314#(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; {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:27,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {66315#(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; {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:27,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {66316#(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; {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:27,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {66317#(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; {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:07:27,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {66318#(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; {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:07:27,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {66319#(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; {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:27,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {66320#(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; {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:27,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:27,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66323#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {66323#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-28 10:07:27,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-28 10:07:27,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-28 10:07:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144040321] [2022-04-28 10:07:27,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144040321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220332634] [2022-04-28 10:07:27,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:27,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:27,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:27,908 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-28 10:07:27,916 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-28 10:07:27,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:27,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:27,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:07:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:27,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:28,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66294#true} is VALID [2022-04-28 10:07:28,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#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); {66294#true} is VALID [2022-04-28 10:07:28,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-28 10:07:28,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-28 10:07:28,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-28 10:07:28,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66299#(= main_~y~0 0)} is VALID [2022-04-28 10:07:28,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {66299#(= 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; {66300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:28,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {66300#(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; {66301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:28,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {66301#(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; {66302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:28,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {66302#(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; {66303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:28,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {66303#(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; {66304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:28,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {66304#(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; {66305#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:28,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {66305#(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; {66306#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:28,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {66306#(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; {66307#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:28,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {66307#(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; {66308#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:28,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {66308#(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; {66309#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:28,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {66309#(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; {66310#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:28,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {66310#(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; {66311#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:28,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {66311#(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; {66312#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:28,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {66312#(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; {66313#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:28,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {66313#(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; {66314#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:28,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {66314#(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; {66315#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:28,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {66315#(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; {66316#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:28,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {66316#(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; {66317#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:28,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {66317#(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; {66318#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:07:28,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {66318#(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; {66319#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:07:28,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {66319#(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; {66320#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:28,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {66320#(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; {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:28,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:28,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {66321#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:07:28,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {66322#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66418#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {66418#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-28 10:07:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:28,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {66295#false} assume !false; {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {66295#false} assume 0 == ~cond; {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {66295#false} ~cond := #in~cond; {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L272 TraceCheckUtils]: 35: Hoare triple {66295#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {66295#false} assume !(~y~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:29,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {66295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {66295#false} is VALID [2022-04-28 10:07:29,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {66464#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66295#false} is VALID [2022-04-28 10:07:29,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {66468#(< 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; {66464#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:29,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {66468#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:29,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:29,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {66479#(< 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; {66472#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:29,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {66483#(< 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; {66479#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:29,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {66487#(< 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; {66483#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:29,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {66491#(< 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; {66487#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:29,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {66495#(< 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; {66491#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:29,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {66499#(< 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; {66495#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:29,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {66503#(< 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; {66499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:29,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {66507#(< 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; {66503#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:29,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {66511#(< 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; {66507#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:29,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {66515#(< 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; {66511#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:29,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {66519#(< 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; {66515#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:29,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {66523#(< 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; {66519#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:29,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {66527#(< 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; {66523#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:29,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {66531#(< 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; {66527#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:29,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {66535#(< 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; {66531#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:07:29,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {66539#(< 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; {66535#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:07:29,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {66543#(< 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; {66539#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:07:29,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {66547#(< 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; {66543#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:07:29,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {66551#(< 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; {66547#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:07:29,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {66555#(< 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; {66551#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:07:29,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {66559#(< 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; {66555#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:29,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {66563#(< 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; {66559#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:07:29,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {66294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66563#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:07:29,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {66294#true} call #t~ret11 := main(); {66294#true} is VALID [2022-04-28 10:07:29,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66294#true} {66294#true} #61#return; {66294#true} is VALID [2022-04-28 10:07:29,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {66294#true} assume true; {66294#true} is VALID [2022-04-28 10:07:29,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {66294#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); {66294#true} is VALID [2022-04-28 10:07:29,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {66294#true} call ULTIMATE.init(); {66294#true} is VALID [2022-04-28 10:07:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220332634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:29,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:07:29,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589116149] [2022-04-28 10:07:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589116149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:29,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:07:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129043531] [2022-04-28 10:07:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:29,282 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 39 [2022-04-28 10:07:29,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:29,282 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-28 10:07:29,304 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-28 10:07:29,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:07:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:29,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:07:29,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2222, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:07:29,305 INFO L87 Difference]: Start difference. First operand 148 states and 191 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-28 10:07:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:33,680 INFO L93 Difference]: Finished difference Result 234 states and 337 transitions. [2022-04-28 10:07:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:07:33,680 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 39 [2022-04-28 10:07:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:33,680 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-28 10:07:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2022-04-28 10:07:33,689 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-28 10:07:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 152 transitions. [2022-04-28 10:07:33,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 152 transitions. [2022-04-28 10:07:33,808 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-28 10:07:33,811 INFO L225 Difference]: With dead ends: 234 [2022-04-28 10:07:33,811 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 10:07:33,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1354, Invalid=4966, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:07:33,811 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 123 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:33,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 172 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 10:07:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 10:07:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2022-04-28 10:07:34,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:34,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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-28 10:07:34,262 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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-28 10:07:34,262 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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-28 10:07:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:34,265 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2022-04-28 10:07:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 278 transitions. [2022-04-28 10:07:34,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:34,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:34,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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 226 states. [2022-04-28 10:07:34,265 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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 226 states. [2022-04-28 10:07:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:34,267 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2022-04-28 10:07:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 278 transitions. [2022-04-28 10:07:34,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:34,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:34,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:34,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.308724832214765) internal successors, (195), 149 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-28 10:07:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 199 transitions. [2022-04-28 10:07:34,269 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 199 transitions. Word has length 39 [2022-04-28 10:07:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:34,269 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 199 transitions. [2022-04-28 10:07:34,269 INFO L496 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-28 10:07:34,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 199 transitions. [2022-04-28 10:07:34,637 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-28 10:07:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2022-04-28 10:07:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:07:34,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:34,638 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:34,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-04-28 10:07:34,838 WARN L477 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-28 10:07:34,838 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 143 times [2022-04-28 10:07:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818200456] [2022-04-28 10:07:34,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:34,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 144 times [2022-04-28 10:07:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463427680] [2022-04-28 10:07:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {67888#(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); {67864#true} is VALID [2022-04-28 10:07:35,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-28 10:07:35,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-28 10:07:35,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:35,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {67888#(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); {67864#true} is VALID [2022-04-28 10:07:35,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-28 10:07:35,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-28 10:07:35,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-28 10:07:35,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67869#(= main_~y~0 0)} is VALID [2022-04-28 10:07:35,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {67869#(= 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; {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:35,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {67870#(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; {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:35,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {67871#(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; {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:35,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {67872#(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; {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:35,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {67873#(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; {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:35,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {67874#(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; {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:35,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {67875#(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; {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:35,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {67876#(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; {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:35,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {67877#(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; {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {67879#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:35,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {67879#(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; {67880#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:35,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {67880#(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; {67881#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:35,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {67881#(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; {67882#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:35,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {67882#(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; {67883#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:35,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {67883#(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; {67884#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:35,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {67884#(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; {67885#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:35,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {67885#(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; {67886#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:35,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {67886#(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; {67887#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {67887#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-28 10:07:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:07:35,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463427680] [2022-04-28 10:07:35,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463427680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998959987] [2022-04-28 10:07:35,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:35,181 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-28 10:07:35,181 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-28 10:07:35,387 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:07:35,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:35,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 10:07:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:35,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:35,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67864#true} is VALID [2022-04-28 10:07:35,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#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); {67864#true} is VALID [2022-04-28 10:07:35,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-28 10:07:35,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-28 10:07:35,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-28 10:07:35,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67869#(= main_~y~0 0)} is VALID [2022-04-28 10:07:35,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {67869#(= 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; {67870#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:35,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {67870#(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; {67871#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:35,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {67871#(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; {67872#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:35,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {67872#(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; {67873#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:35,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {67873#(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; {67874#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:35,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {67874#(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; {67875#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:35,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {67875#(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; {67876#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:35,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {67876#(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; {67877#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:35,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {67877#(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; {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {67878#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {67940#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {67940#(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; {67944#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:35,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {67944#(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; {67948#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {67948#(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; {67952#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {67952#(and (= (+ (- 2) main_~y~0) (+ 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; {67956#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {67956#(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; {67960#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {67960#(and (= (+ main_~y~0 (- 4)) (+ 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; {67964#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {67964#(and (= (+ main_~y~0 (- 4)) (+ 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; {67968#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {67968#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 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; {67972#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {67972#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {67865#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-28 10:07:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:07:35,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:36,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {67865#false} assume !false; {67865#false} is VALID [2022-04-28 10:07:36,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {67865#false} assume 0 == ~cond; {67865#false} is VALID [2022-04-28 10:07:36,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {67865#false} ~cond := #in~cond; {67865#false} is VALID [2022-04-28 10:07:36,452 INFO L272 TraceCheckUtils]: 36: Hoare triple {67865#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67865#false} is VALID [2022-04-28 10:07:36,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {67865#false} assume !(~y~0 % 4294967296 > 0); {67865#false} is VALID [2022-04-28 10:07:36,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {68033#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {67865#false} is VALID [2022-04-28 10:07:36,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {68037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68033#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:36,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {68041#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:36,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {68045#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68041#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:36,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {68049#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68045#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:36,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {68053#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68049#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:36,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {68057#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68053#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:36,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {68061#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68057#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:36,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {68065#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {68061#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:07:36,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {68069#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {68065#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:36,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {68073#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {68069#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:07:36,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {68077#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {68073#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:36,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {68081#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {68077#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:36,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {68085#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {68081#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:36,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {68089#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {68085#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:36,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {68093#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {68089#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:36,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {68097#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {68093#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:36,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {68101#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {68097#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {67864#true} ~z~0 := ~y~0; {68101#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {67864#true} assume !(~x~0 % 4294967296 > 0); {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {67864#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; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {67864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {67864#true} call #t~ret11 := main(); {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67864#true} {67864#true} #61#return; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {67864#true} assume true; {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {67864#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); {67864#true} is VALID [2022-04-28 10:07:36,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {67864#true} call ULTIMATE.init(); {67864#true} is VALID [2022-04-28 10:07:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:07:36,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998959987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:36,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:36,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 49 [2022-04-28 10:07:36,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:36,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1818200456] [2022-04-28 10:07:36,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1818200456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:36,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:36,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:07:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160122299] [2022-04-28 10:07:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:36,466 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 40 [2022-04-28 10:07:36,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:36,467 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-28 10:07:36,488 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-28 10:07:36,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:07:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:07:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:07:36,488 INFO L87 Difference]: Start difference. First operand 154 states and 199 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-28 10:07:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:38,212 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-04-28 10:07:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:07:38,212 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 40 [2022-04-28 10:07:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:38,212 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-28 10:07:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 10:07:38,213 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-28 10:07:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 10:07:38,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-28 10:07:38,257 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-28 10:07:38,259 INFO L225 Difference]: With dead ends: 181 [2022-04-28 10:07:38,259 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 10:07:38,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:07:38,259 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:38,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:07:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 10:07:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2022-04-28 10:07:38,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:38,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:38,718 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:38,718 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:38,720 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2022-04-28 10:07:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2022-04-28 10:07:38,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:38,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:38,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 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 166 states. [2022-04-28 10:07:38,720 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 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 166 states. [2022-04-28 10:07:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:38,721 INFO L93 Difference]: Finished difference Result 166 states and 211 transitions. [2022-04-28 10:07:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2022-04-28 10:07:38,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:38,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:38,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:38,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 150 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2022-04-28 10:07:38,724 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 40 [2022-04-28 10:07:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:38,724 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2022-04-28 10:07:38,724 INFO L496 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-28 10:07:38,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2022-04-28 10:07:39,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2022-04-28 10:07:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:07:39,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:39,101 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:39,117 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-28 10:07:39,303 WARN L477 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-28 10:07:39,303 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 145 times [2022-04-28 10:07:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:39,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691122238] [2022-04-28 10:07:39,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:39,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 146 times [2022-04-28 10:07:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:39,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669551881] [2022-04-28 10:07:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:39,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {69220#(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); {69197#true} is VALID [2022-04-28 10:07:39,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-28 10:07:39,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-28 10:07:39,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:39,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {69220#(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); {69197#true} is VALID [2022-04-28 10:07:39,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-28 10:07:39,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-28 10:07:39,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-28 10:07:39,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69202#(= main_~y~0 0)} is VALID [2022-04-28 10:07:39,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {69202#(= 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; {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:39,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {69203#(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; {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:39,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {69204#(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; {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:39,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {69205#(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; {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:39,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {69206#(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; {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:39,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {69207#(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; {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:39,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {69208#(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; {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:39,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {69209#(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; {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:39,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {69210#(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; {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:39,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {69211#(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; {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:39,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:39,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:39,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {69213#(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; {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:39,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {69214#(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; {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:39,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {69215#(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; {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:39,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {69216#(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; {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:39,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {69217#(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; {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {69218#(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; {69219#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {69219#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-28 10:07:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669551881] [2022-04-28 10:07:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669551881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125583477] [2022-04-28 10:07:39,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:39,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:39,588 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-28 10:07:39,591 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-28 10:07:39,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:39,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:39,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:07:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:39,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:39,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69197#true} is VALID [2022-04-28 10:07:39,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#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); {69197#true} is VALID [2022-04-28 10:07:39,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-28 10:07:39,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-28 10:07:39,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-28 10:07:39,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69202#(= main_~y~0 0)} is VALID [2022-04-28 10:07:39,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {69202#(= 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; {69203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:39,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {69203#(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; {69204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:39,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {69204#(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; {69205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:39,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {69205#(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; {69206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:39,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {69206#(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; {69207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:39,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {69207#(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; {69208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:39,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {69208#(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; {69209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:39,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {69209#(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; {69210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:39,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {69210#(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; {69211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:39,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {69211#(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; {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:39,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:39,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {69212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {69213#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:39,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {69213#(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; {69214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:39,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {69214#(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; {69215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:39,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {69215#(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; {69216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:39,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {69216#(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; {69217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:39,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {69217#(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; {69218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:39,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {69218#(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; {69293#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {69293#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-28 10:07:39,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-28 10:07:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:39,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {69198#false} assume !false; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {69198#false} assume 0 == ~cond; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {69198#false} ~cond := #in~cond; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L272 TraceCheckUtils]: 36: Hoare triple {69198#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {69198#false} assume !(~y~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {69198#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {69198#false} is VALID [2022-04-28 10:07:40,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {69387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69198#false} is VALID [2022-04-28 10:07:40,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {69391#(< 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; {69387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:40,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {69395#(< 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; {69391#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:40,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {69399#(< 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; {69395#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:40,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {69403#(< 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; {69399#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:40,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {69407#(< 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; {69403#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:40,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {69411#(< 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; {69407#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:40,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {69411#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:40,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {69422#(< 0 (mod (+ 4294967291 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; {69415#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {69426#(< 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; {69422#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {69430#(< 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; {69426#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:40,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {69434#(< 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; {69430#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:40,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {69438#(< 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; {69434#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:40,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {69442#(< 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; {69438#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:40,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {69446#(< 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; {69442#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:40,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {69450#(< 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; {69446#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:40,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {69454#(< 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; {69450#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:40,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {69458#(< 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; {69454#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:40,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {69197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69458#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:40,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {69197#true} call #t~ret11 := main(); {69197#true} is VALID [2022-04-28 10:07:40,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69197#true} {69197#true} #61#return; {69197#true} is VALID [2022-04-28 10:07:40,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {69197#true} assume true; {69197#true} is VALID [2022-04-28 10:07:40,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {69197#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); {69197#true} is VALID [2022-04-28 10:07:40,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {69197#true} call ULTIMATE.init(); {69197#true} is VALID [2022-04-28 10:07:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:07:40,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125583477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:40,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:40,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:07:40,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:40,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691122238] [2022-04-28 10:07:40,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691122238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:40,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:40,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927326727] [2022-04-28 10:07:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:40,476 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 40 [2022-04-28 10:07:40,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:40,476 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-28 10:07:40,497 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-28 10:07:40,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:40,497 INFO L87 Difference]: Start difference. First operand 155 states and 200 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-28 10:07:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:42,569 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-04-28 10:07:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:07:42,569 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 40 [2022-04-28 10:07:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:42,569 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-28 10:07:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 10:07:42,570 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-28 10:07:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 10:07:42,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-28 10:07:42,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:42,644 INFO L225 Difference]: With dead ends: 184 [2022-04-28 10:07:42,644 INFO L226 Difference]: Without dead ends: 168 [2022-04-28 10:07:42,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3302, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:07:42,644 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:42,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-28 10:07:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2022-04-28 10:07:43,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:43,144 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:43,144 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:43,146 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-04-28 10:07:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-28 10:07:43,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:43,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:43,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 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 168 states. [2022-04-28 10:07:43,146 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 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 168 states. [2022-04-28 10:07:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:43,148 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2022-04-28 10:07:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-04-28 10:07:43,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:43,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:43,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:43,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.304635761589404) internal successors, (197), 151 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2022-04-28 10:07:43,149 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 40 [2022-04-28 10:07:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:43,149 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2022-04-28 10:07:43,149 INFO L496 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-28 10:07:43,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 201 transitions. [2022-04-28 10:07:43,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2022-04-28 10:07:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:07:43,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:43,524 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:43,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-04-28 10:07:43,725 WARN L477 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-28 10:07:43,725 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 147 times [2022-04-28 10:07:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:43,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977903729] [2022-04-28 10:07:43,727 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:43,727 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 148 times [2022-04-28 10:07:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:43,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777009173] [2022-04-28 10:07:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:44,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {70565#(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); {70543#true} is VALID [2022-04-28 10:07:44,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-28 10:07:44,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-28 10:07:44,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:44,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {70565#(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); {70543#true} is VALID [2022-04-28 10:07:44,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-28 10:07:44,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-28 10:07:44,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-28 10:07:44,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70548#(= main_~y~0 0)} is VALID [2022-04-28 10:07:44,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {70548#(= 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; {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:44,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {70549#(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; {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:44,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {70550#(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; {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:44,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {70551#(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; {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:44,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {70552#(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; {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:44,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {70553#(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; {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:44,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {70554#(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; {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:44,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {70555#(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; {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:44,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#(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; {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:44,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {70557#(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; {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:44,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {70558#(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; {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:44,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:44,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:44,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {70560#(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; {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:44,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {70561#(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; {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:44,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {70562#(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; {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:44,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {70563#(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; {70564#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {70564#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-28 10:07:44,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-28 10:07:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:44,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777009173] [2022-04-28 10:07:44,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777009173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:44,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745393702] [2022-04-28 10:07:44,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:44,053 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-28 10:07:44,053 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-28 10:07:44,102 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:44,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:44,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:07:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:44,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:44,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70543#true} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#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); {70543#true} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-28 10:07:44,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-28 10:07:44,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70548#(= main_~y~0 0)} is VALID [2022-04-28 10:07:44,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {70548#(= 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; {70549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:44,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {70549#(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; {70550#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:44,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {70550#(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; {70551#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:44,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {70551#(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; {70552#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:44,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {70552#(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; {70553#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:44,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {70553#(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; {70554#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:44,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {70554#(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; {70555#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:44,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {70555#(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; {70556#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:44,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#(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; {70557#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:44,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {70557#(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; {70558#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:44,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {70558#(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; {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:44,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:44,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {70559#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {70560#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:44,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {70560#(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; {70561#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:44,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {70561#(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; {70562#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:07:44,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {70562#(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; {70563#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:44,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {70563#(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; {70635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:44,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {70635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-28 10:07:44,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-28 10:07:44,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-28 10:07:44,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-28 10:07:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:44,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:44,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {70544#false} assume !false; {70544#false} is VALID [2022-04-28 10:07:44,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {70544#false} assume 0 == ~cond; {70544#false} is VALID [2022-04-28 10:07:44,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {70544#false} ~cond := #in~cond; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L272 TraceCheckUtils]: 36: Hoare triple {70544#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {70544#false} assume !(~y~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {70544#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {70544#false} is VALID [2022-04-28 10:07:44,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {70735#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70544#false} is VALID [2022-04-28 10:07:44,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {70739#(< 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; {70735#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:44,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {70743#(< 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; {70739#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:44,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {70747#(< 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; {70743#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:44,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {70751#(< 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; {70747#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:44,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {70751#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:07:44,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {70762#(< 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; {70755#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {70766#(< 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; {70762#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:44,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {70770#(< 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; {70766#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:44,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {70774#(< 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; {70770#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:44,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {70778#(< 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; {70774#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:44,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {70782#(< 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; {70778#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:44,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {70786#(< 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; {70782#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:44,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {70790#(< 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; {70786#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:44,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {70794#(< 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; {70790#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:44,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {70798#(< 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; {70794#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {70802#(< 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; {70798#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:44,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {70543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70802#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:44,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {70543#true} call #t~ret11 := main(); {70543#true} is VALID [2022-04-28 10:07:44,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70543#true} {70543#true} #61#return; {70543#true} is VALID [2022-04-28 10:07:44,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {70543#true} assume true; {70543#true} is VALID [2022-04-28 10:07:44,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {70543#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); {70543#true} is VALID [2022-04-28 10:07:44,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {70543#true} call ULTIMATE.init(); {70543#true} is VALID [2022-04-28 10:07:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:07:44,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745393702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:44,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:07:44,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977903729] [2022-04-28 10:07:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977903729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:44,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:07:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91261168] [2022-04-28 10:07:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:44,923 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 40 [2022-04-28 10:07:44,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:44,923 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-28 10:07:44,945 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-28 10:07:44,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:07:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:07:44,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:07:44,946 INFO L87 Difference]: Start difference. First operand 156 states and 201 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-28 10:07:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:47,079 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-04-28 10:07:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:07:47,079 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 40 [2022-04-28 10:07:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:47,079 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-28 10:07:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 10:07:47,080 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-28 10:07:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 10:07:47,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-28 10:07:47,137 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-28 10:07:47,138 INFO L225 Difference]: With dead ends: 187 [2022-04-28 10:07:47,138 INFO L226 Difference]: Without dead ends: 170 [2022-04-28 10:07:47,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=3054, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:07:47,139 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-28 10:07:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2022-04-28 10:07:47,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:47,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:47,673 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:47,673 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:47,674 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2022-04-28 10:07:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2022-04-28 10:07:47,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:47,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:47,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 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 170 states. [2022-04-28 10:07:47,675 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 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 170 states. [2022-04-28 10:07:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:47,676 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2022-04-28 10:07:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2022-04-28 10:07:47,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:47,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:47,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:47,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2022-04-28 10:07:47,678 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 40 [2022-04-28 10:07:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:47,678 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2022-04-28 10:07:47,678 INFO L496 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-28 10:07:47,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 202 transitions. [2022-04-28 10:07:48,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2022-04-28 10:07:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:07:48,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:48,064 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:48,081 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-28 10:07:48,265 WARN L477 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-28 10:07:48,265 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 149 times [2022-04-28 10:07:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388482119] [2022-04-28 10:07:48,267 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:48,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 150 times [2022-04-28 10:07:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241232922] [2022-04-28 10:07:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {71920#(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); {71899#true} is VALID [2022-04-28 10:07:48,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-28 10:07:48,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-28 10:07:48,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:48,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {71920#(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); {71899#true} is VALID [2022-04-28 10:07:48,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-28 10:07:48,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-28 10:07:48,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-28 10:07:48,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71904#(= main_~y~0 0)} is VALID [2022-04-28 10:07:48,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {71904#(= 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; {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:48,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {71905#(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; {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:48,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {71906#(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; {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:48,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {71907#(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; {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:48,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {71908#(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; {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:48,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {71909#(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; {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:48,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {71910#(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; {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:48,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {71911#(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; {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:48,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {71912#(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; {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:48,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {71913#(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; {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:48,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {71914#(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; {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:48,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {71915#(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; {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:48,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:48,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:07:48,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {71917#(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; {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:48,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {71918#(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; {71919#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:48,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {71919#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:48,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-28 10:07:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:07:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:48,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241232922] [2022-04-28 10:07:48,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241232922] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:48,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734157926] [2022-04-28 10:07:48,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:48,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:48,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:48,514 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-28 10:07:48,514 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-28 10:07:48,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:07:48,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:48,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:07:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:48,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:49,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71899#true} is VALID [2022-04-28 10:07:49,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#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); {71899#true} is VALID [2022-04-28 10:07:49,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-28 10:07:49,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-28 10:07:49,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-28 10:07:49,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71904#(= main_~y~0 0)} is VALID [2022-04-28 10:07:49,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {71904#(= 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; {71905#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:49,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {71905#(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; {71906#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:49,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {71906#(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; {71907#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:49,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {71907#(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; {71908#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:49,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {71908#(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; {71909#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:49,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {71909#(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; {71910#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:49,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {71910#(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; {71911#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:49,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {71911#(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; {71912#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:49,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {71912#(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; {71913#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:49,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {71913#(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; {71914#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:49,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {71914#(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; {71915#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:49,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {71915#(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; {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:49,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:49,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {71916#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {71917#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:07:49,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {71917#(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; {71918#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:07:49,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {71918#(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; {71987#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:07:49,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {71987#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:49,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-28 10:07:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:07:49,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {71900#false} assume !false; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {71900#false} assume 0 == ~cond; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {71900#false} ~cond := #in~cond; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L272 TraceCheckUtils]: 36: Hoare triple {71900#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {71900#false} assume !(~y~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {71900#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {71900#false} is VALID [2022-04-28 10:07:49,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {72093#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71900#false} is VALID [2022-04-28 10:07:49,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {72097#(< 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; {72093#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:49,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {72101#(< 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; {72097#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:49,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {72101#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:49,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:49,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {72112#(< 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; {72105#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:49,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {72116#(< 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; {72112#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:49,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {72120#(< 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; {72116#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:49,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {72124#(< 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; {72120#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:49,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {72128#(< 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; {72124#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:49,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {72132#(< 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; {72128#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:49,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {72136#(< 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; {72132#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:49,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {72140#(< 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; {72136#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:49,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {72144#(< 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; {72140#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:49,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {72148#(< 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; {72144#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:49,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {72152#(< 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; {72148#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:49,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {72156#(< 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; {72152#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:49,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {71899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72156#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:49,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {71899#true} call #t~ret11 := main(); {71899#true} is VALID [2022-04-28 10:07:49,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71899#true} {71899#true} #61#return; {71899#true} is VALID [2022-04-28 10:07:49,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {71899#true} assume true; {71899#true} is VALID [2022-04-28 10:07:49,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {71899#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); {71899#true} is VALID [2022-04-28 10:07:49,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {71899#true} call ULTIMATE.init(); {71899#true} is VALID [2022-04-28 10:07:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:07:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734157926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:49,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:07:49,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:49,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388482119] [2022-04-28 10:07:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388482119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:49,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:07:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821355391] [2022-04-28 10:07:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:49,654 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 40 [2022-04-28 10:07:49,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:49,654 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-28 10:07:49,672 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-28 10:07:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:07:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:07:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:07:49,673 INFO L87 Difference]: Start difference. First operand 157 states and 202 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-28 10:07:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:51,617 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2022-04-28 10:07:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:07:51,617 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 40 [2022-04-28 10:07:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:51,618 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-28 10:07:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 10:07:51,618 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-28 10:07:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 10:07:51,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-28 10:07:51,675 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-28 10:07:51,677 INFO L225 Difference]: With dead ends: 190 [2022-04-28 10:07:51,677 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 10:07:51,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:07:51,678 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:51,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 10:07:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2022-04-28 10:07:52,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:52,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,164 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,164 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,166 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-28 10:07:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2022-04-28 10:07:52,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 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 172 states. [2022-04-28 10:07:52,167 INFO L87 Difference]: Start difference. First operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 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 172 states. [2022-04-28 10:07:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:52,169 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2022-04-28 10:07:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2022-04-28 10:07:52,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:52,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:52,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:52,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 153 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:07:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2022-04-28 10:07:52,172 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 40 [2022-04-28 10:07:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:52,172 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2022-04-28 10:07:52,172 INFO L496 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-28 10:07:52,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 203 transitions. [2022-04-28 10:07:52,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2022-04-28 10:07:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:07:52,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:52,566 INFO L195 NwaCegarLoop]: trace histogram [23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:52,570 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-28 10:07:52,766 WARN L477 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-28 10:07:52,766 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -785244818, now seen corresponding path program 151 times [2022-04-28 10:07:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195147337] [2022-04-28 10:07:52,769 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:52,769 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -785244818, now seen corresponding path program 152 times [2022-04-28 10:07:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196873270] [2022-04-28 10:07:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {73286#(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); {73255#true} is VALID [2022-04-28 10:07:53,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-28 10:07:53,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-28 10:07:53,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:53,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {73286#(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); {73255#true} is VALID [2022-04-28 10:07:53,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-28 10:07:53,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-28 10:07:53,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-28 10:07:53,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73260#(= main_~y~0 0)} is VALID [2022-04-28 10:07:53,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {73260#(= 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; {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:53,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {73261#(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; {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:53,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {73262#(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; {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:53,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {73263#(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; {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:53,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {73264#(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; {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:53,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {73265#(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; {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:53,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {73266#(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; {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:53,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {73267#(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; {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:53,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {73268#(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; {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:53,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {73269#(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; {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:53,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {73270#(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; {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:53,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {73271#(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; {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:53,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {73272#(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; {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:53,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {73273#(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; {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:53,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {73274#(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; {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:53,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {73275#(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; {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:53,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {73276#(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; {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:53,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {73277#(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; {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:53,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {73278#(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; {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:07:53,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {73279#(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; {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:07:53,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {73280#(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; {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:53,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {73281#(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; {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:53,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {73282#(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; {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:07:53,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:07:53,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73285#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {73285#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-28 10:07:53,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-28 10:07:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196873270] [2022-04-28 10:07:53,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196873270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101971027] [2022-04-28 10:07:53,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:53,250 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-28 10:07:53,250 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-28 10:07:53,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:53,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:53,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:07:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:53,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:53,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73255#true} is VALID [2022-04-28 10:07:53,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#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); {73255#true} is VALID [2022-04-28 10:07:53,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-28 10:07:53,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-28 10:07:53,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-28 10:07:53,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73260#(= main_~y~0 0)} is VALID [2022-04-28 10:07:53,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {73260#(= 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; {73261#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:53,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {73261#(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; {73262#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:53,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {73262#(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; {73263#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:53,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {73263#(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; {73264#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:53,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {73264#(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; {73265#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:53,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {73265#(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; {73266#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:53,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {73266#(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; {73267#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:53,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {73267#(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; {73268#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:53,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {73268#(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; {73269#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:53,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {73269#(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; {73270#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:53,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {73270#(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; {73271#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:53,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {73271#(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; {73272#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:53,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {73272#(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; {73273#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:53,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {73273#(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; {73274#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:53,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {73274#(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; {73275#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:53,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {73275#(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; {73276#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:53,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {73276#(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; {73277#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:53,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {73277#(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; {73278#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:53,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {73278#(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; {73279#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:07:53,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {73279#(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; {73280#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:07:53,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {73280#(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; {73281#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:07:53,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {73281#(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; {73282#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:07:53,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {73282#(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; {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:07:53,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:07:53,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {73283#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {73284#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73383#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {73383#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-28 10:07:53,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-28 10:07:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:53,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:54,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {73256#false} assume !false; {73256#false} is VALID [2022-04-28 10:07:54,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {73256#false} assume 0 == ~cond; {73256#false} is VALID [2022-04-28 10:07:54,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {73256#false} ~cond := #in~cond; {73256#false} is VALID [2022-04-28 10:07:54,705 INFO L272 TraceCheckUtils]: 36: Hoare triple {73256#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {73256#false} is VALID [2022-04-28 10:07:54,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {73256#false} assume !(~y~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:54,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:54,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {73256#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {73256#false} is VALID [2022-04-28 10:07:54,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {73429#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73256#false} is VALID [2022-04-28 10:07:54,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {73433#(< 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; {73429#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:54,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {73433#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {73444#(< 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; {73437#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:54,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {73448#(< 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; {73444#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:54,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {73452#(< 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; {73448#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:54,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {73456#(< 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; {73452#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:54,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {73460#(< 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; {73456#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:54,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {73464#(< 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; {73460#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:54,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {73468#(< 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; {73464#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:54,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {73472#(< 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; {73468#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:54,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {73476#(< 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; {73472#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:54,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {73480#(< 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; {73476#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:54,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {73484#(< 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; {73480#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:54,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {73488#(< 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; {73484#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:54,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {73492#(< 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; {73488#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:54,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {73496#(< 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; {73492#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:54,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {73500#(< 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; {73496#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:07:54,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {73504#(< 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; {73500#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:07:54,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {73508#(< 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; {73504#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:07:54,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {73512#(< 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; {73508#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:07:54,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {73516#(< 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; {73512#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:07:54,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {73520#(< 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; {73516#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:07:54,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {73524#(< 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; {73520#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:54,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {73528#(< 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; {73524#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:07:54,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {73532#(< 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; {73528#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:07:54,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {73255#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73532#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:07:54,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {73255#true} call #t~ret11 := main(); {73255#true} is VALID [2022-04-28 10:07:54,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73255#true} {73255#true} #61#return; {73255#true} is VALID [2022-04-28 10:07:54,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {73255#true} assume true; {73255#true} is VALID [2022-04-28 10:07:54,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {73255#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); {73255#true} is VALID [2022-04-28 10:07:54,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {73255#true} call ULTIMATE.init(); {73255#true} is VALID [2022-04-28 10:07:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:07:54,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101971027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:54,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:54,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:07:54,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195147337] [2022-04-28 10:07:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195147337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:54,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:54,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:07:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29228273] [2022-04-28 10:07:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:54,728 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 40 [2022-04-28 10:07:54,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:54,728 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-28 10:07:54,757 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-28 10:07:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:07:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:07:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=2389, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:07:54,758 INFO L87 Difference]: Start difference. First operand 158 states and 203 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-28 10:07:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:59,761 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2022-04-28 10:07:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:07:59,761 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 40 [2022-04-28 10:07:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:59,761 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-28 10:07:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2022-04-28 10:07:59,762 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-28 10:07:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2022-04-28 10:07:59,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 159 transitions. [2022-04-28 10:07:59,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:59,890 INFO L225 Difference]: With dead ends: 245 [2022-04-28 10:07:59,890 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 10:07:59,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1459, Invalid=5347, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 10:07:59,891 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:59,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 185 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:07:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 10:08:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 164. [2022-04-28 10:08:00,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:00,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,401 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,401 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,403 INFO L93 Difference]: Finished difference Result 237 states and 291 transitions. [2022-04-28 10:08:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2022-04-28 10:08:00,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 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-28 10:08:00,404 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 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-28 10:08:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,406 INFO L93 Difference]: Finished difference Result 237 states and 291 transitions. [2022-04-28 10:08:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2022-04-28 10:08:00,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:00,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 159 states have internal predecessors, (207), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2022-04-28 10:08:00,408 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 40 [2022-04-28 10:08:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:00,408 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2022-04-28 10:08:00,408 INFO L496 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-28 10:08:00,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 211 transitions. [2022-04-28 10:08:00,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2022-04-28 10:08:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:08:00,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:00,812 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:00,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-04-28 10:08:01,013 WARN L477 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-28 10:08:01,013 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 153 times [2022-04-28 10:08:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [67446941] [2022-04-28 10:08:01,015 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:01,016 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 154 times [2022-04-28 10:08:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:01,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550302766] [2022-04-28 10:08:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:01,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {74916#(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); {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {74916#(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); {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= 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; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= 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; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= 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; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= 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; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= 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; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= 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; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= 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; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,224 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {74914#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:01,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {74914#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {74915#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:01,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {74915#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {74900#false} is VALID [2022-04-28 10:08:01,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-28 10:08:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:01,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550302766] [2022-04-28 10:08:01,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550302766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:01,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516972960] [2022-04-28 10:08:01,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:01,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:01,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:01,226 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-28 10:08:01,227 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-28 10:08:01,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:01,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:01,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:08:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:01,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:01,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#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); {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= 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; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= 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; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= 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; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= 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; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= 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; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= 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; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= 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; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,563 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:01,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:01,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {75035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {74900#false} is VALID [2022-04-28 10:08:01,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-28 10:08:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:01,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:01,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {74900#false} assume !false; {74900#false} is VALID [2022-04-28 10:08:01,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {75035#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {74900#false} is VALID [2022-04-28 10:08:01,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75035#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:08:01,843 INFO L272 TraceCheckUtils]: 37: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {75031#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:08:01,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {74913#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:08:01,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {74912#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {74910#(<= 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; {74911#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {74909#(<= 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; {74910#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {74908#(<= 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; {74909#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:08:01,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {74907#(<= 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; {74908#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {74906#(<= 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; {74907#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {74905#(<= 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; {74906#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:08:01,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {74904#(<= 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; {74905#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {74899#true} assume !(~x~0 % 4294967296 > 0); {74904#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {74899#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; {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {74899#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {74899#true} call #t~ret11 := main(); {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74899#true} {74899#true} #61#return; {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {74899#true} assume true; {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {74899#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); {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {74899#true} call ULTIMATE.init(); {74899#true} is VALID [2022-04-28 10:08:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516972960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:01,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:01,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2022-04-28 10:08:01,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:01,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [67446941] [2022-04-28 10:08:01,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [67446941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:01,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:01,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:08:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253401062] [2022-04-28 10:08:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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 41 [2022-04-28 10:08:01,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:01,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-28 10:08:01,885 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-28 10:08:01,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:08:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:08:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:08:01,886 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-28 10:08:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:05,470 INFO L93 Difference]: Finished difference Result 485 states and 645 transitions. [2022-04-28 10:08:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:08:05,470 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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 41 [2022-04-28 10:08:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-28 10:08:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-28 10:08:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-28 10:08:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-04-28 10:08:05,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-04-28 10:08:05,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:05,541 INFO L225 Difference]: With dead ends: 485 [2022-04-28 10:08:05,541 INFO L226 Difference]: Without dead ends: 470 [2022-04-28 10:08:05,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:08:05,542 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:05,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 100 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-28 10:08:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 168. [2022-04-28 10:08:06,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:06,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:06,065 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:06,066 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,072 INFO L93 Difference]: Finished difference Result 470 states and 629 transitions. [2022-04-28 10:08:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-04-28 10:08:06,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:06,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:06,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 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 470 states. [2022-04-28 10:08:06,073 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 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 470 states. [2022-04-28 10:08:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:06,080 INFO L93 Difference]: Finished difference Result 470 states and 629 transitions. [2022-04-28 10:08:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2022-04-28 10:08:06,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:06,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:06,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:06,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 217 transitions. [2022-04-28 10:08:06,082 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 217 transitions. Word has length 41 [2022-04-28 10:08:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:06,082 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 217 transitions. [2022-04-28 10:08:06,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-28 10:08:06,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 217 transitions. [2022-04-28 10:08:06,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 217 transitions. [2022-04-28 10:08:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:08:06,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:06,546 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:06,562 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-28 10:08:06,747 WARN L477 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-28 10:08:06,747 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 155 times [2022-04-28 10:08:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263626017] [2022-04-28 10:08:06,749 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:06,749 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 156 times [2022-04-28 10:08:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045073730] [2022-04-28 10:08:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {77458#(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); {77434#true} is VALID [2022-04-28 10:08:07,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-28 10:08:07,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-28 10:08:07,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77458#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:07,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {77458#(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); {77434#true} is VALID [2022-04-28 10:08:07,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-28 10:08:07,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-28 10:08:07,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-28 10:08:07,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77439#(= main_~y~0 0)} is VALID [2022-04-28 10:08:07,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {77439#(= 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; {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:07,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {77440#(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; {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:07,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {77441#(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; {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:07,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {77442#(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; {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:07,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {77443#(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; {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:07,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {77444#(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; {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {77445#(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; {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:07,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {77446#(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; {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:07,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {77447#(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; {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:07,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {77448#(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; {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77450#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:07,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {77450#(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; {77451#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:07,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {77451#(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; {77452#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:07,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {77452#(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; {77453#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:07,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {77453#(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; {77454#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:07,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {77454#(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; {77455#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:07,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {77455#(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; {77456#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:07,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {77456#(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; {77457#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {77457#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-28 10:08:07,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-28 10:08:07,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-28 10:08:07,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-28 10:08:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:08:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045073730] [2022-04-28 10:08:07,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045073730] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028846498] [2022-04-28 10:08:07,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:07,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:07,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:07,064 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-28 10:08:07,065 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-28 10:08:07,190 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:08:07,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:07,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 10:08:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:07,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77434#true} is VALID [2022-04-28 10:08:07,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#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); {77434#true} is VALID [2022-04-28 10:08:07,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-28 10:08:07,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-28 10:08:07,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-28 10:08:07,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77439#(= main_~y~0 0)} is VALID [2022-04-28 10:08:07,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {77439#(= 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; {77440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:07,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {77440#(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; {77441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:07,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {77441#(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; {77442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:07,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {77442#(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; {77443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:07,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {77443#(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; {77444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:07,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {77444#(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; {77445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {77445#(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; {77446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:07,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {77446#(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; {77447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:07,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {77447#(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; {77448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:07,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {77448#(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; {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {77449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77513#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {77513#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 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; {77517#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:07,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {77517#(and (<= main_~y~0 10) (<= 10 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; {77521#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {77521#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 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; {77525#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:08:07,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {77525#(and (<= main_~y~0 10) (<= 10 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; {77529#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {77529#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {77533#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:08:07,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {77533#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ 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; {77537#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {77537#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {77541#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {77541#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} assume !(~z~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-28 10:08:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:08:07,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {77435#false} assume !false; {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {77435#false} assume 0 == ~cond; {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {77435#false} ~cond := #in~cond; {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L272 TraceCheckUtils]: 37: Hoare triple {77435#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {77435#false} assume !(~y~0 % 4294967296 > 0); {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {77435#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:08,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {77611#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77435#false} is VALID [2022-04-28 10:08:08,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {77615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77611#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:08,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {77619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:08,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {77623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:08,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {77627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:08,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {77631#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:08,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {77635#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77631#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:08,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {77639#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {77635#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:08,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {77643#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77639#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:08:08,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {77647#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {77643#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:08,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {77651#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {77647#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:08,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {77655#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {77651#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:08,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {77659#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {77655#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:08,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {77663#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {77659#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:08,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {77667#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {77663#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:08,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {77671#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {77667#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:08,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {77434#true} ~z~0 := ~y~0; {77671#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:08:08,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {77434#true} assume !(~x~0 % 4294967296 > 0); {77434#true} is VALID [2022-04-28 10:08:08,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {77434#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; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {77434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {77434#true} call #t~ret11 := main(); {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77434#true} {77434#true} #61#return; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {77434#true} assume true; {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {77434#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); {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {77434#true} call ULTIMATE.init(); {77434#true} is VALID [2022-04-28 10:08:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:08:08,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028846498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:08,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:08,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 18] total 46 [2022-04-28 10:08:08,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:08,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263626017] [2022-04-28 10:08:08,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263626017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:08,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:08,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949169990] [2022-04-28 10:08:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:08,303 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 41 [2022-04-28 10:08:08,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:08,303 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-28 10:08:08,324 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-28 10:08:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:08,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:08,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1813, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:08:08,325 INFO L87 Difference]: Start difference. First operand 168 states and 217 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-28 10:08:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:10,621 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2022-04-28 10:08:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:08:10,621 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 41 [2022-04-28 10:08:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:10,621 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-28 10:08:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-28 10:08:10,623 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-28 10:08:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 70 transitions. [2022-04-28 10:08:10,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 70 transitions. [2022-04-28 10:08:10,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:10,680 INFO L225 Difference]: With dead ends: 197 [2022-04-28 10:08:10,680 INFO L226 Difference]: Without dead ends: 181 [2022-04-28 10:08:10,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=542, Invalid=4570, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:08:10,681 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:10,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-28 10:08:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2022-04-28 10:08:11,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:11,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:11,228 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,230 INFO L93 Difference]: Finished difference Result 181 states and 230 transitions. [2022-04-28 10:08:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2022-04-28 10:08:11,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:11,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:11,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 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-28 10:08:11,231 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 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-28 10:08:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,232 INFO L93 Difference]: Finished difference Result 181 states and 230 transitions. [2022-04-28 10:08:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2022-04-28 10:08:11,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:11,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:11,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:11,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 218 transitions. [2022-04-28 10:08:11,235 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 218 transitions. Word has length 41 [2022-04-28 10:08:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:11,235 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 218 transitions. [2022-04-28 10:08:11,235 INFO L496 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-28 10:08:11,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 218 transitions. [2022-04-28 10:08:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-04-28 10:08:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:08:11,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:11,713 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:11,913 WARN L477 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-28 10:08:11,913 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 157 times [2022-04-28 10:08:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:11,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548497929] [2022-04-28 10:08:11,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:11,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 158 times [2022-04-28 10:08:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566245720] [2022-04-28 10:08:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {78897#(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); {78874#true} is VALID [2022-04-28 10:08:12,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-28 10:08:12,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-28 10:08:12,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:12,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {78897#(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); {78874#true} is VALID [2022-04-28 10:08:12,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-28 10:08:12,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-28 10:08:12,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-28 10:08:12,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78879#(= main_~y~0 0)} is VALID [2022-04-28 10:08:12,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {78879#(= 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; {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:12,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {78880#(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; {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:12,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {78881#(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; {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:12,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {78882#(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; {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:12,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {78883#(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; {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:12,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {78884#(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; {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:12,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {78885#(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; {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:12,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {78886#(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; {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:12,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {78887#(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; {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:12,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {78888#(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; {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:12,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {78889#(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; {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:12,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {78891#(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; {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:12,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {78892#(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; {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:12,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {78893#(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; {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:12,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {78894#(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; {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {78895#(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; {78896#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {78896#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-28 10:08:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566245720] [2022-04-28 10:08:12,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566245720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693397298] [2022-04-28 10:08:12,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:12,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:12,250 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-28 10:08:12,251 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-28 10:08:12,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:12,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:12,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:08:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:12,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:12,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78874#true} is VALID [2022-04-28 10:08:12,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#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); {78874#true} is VALID [2022-04-28 10:08:12,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-28 10:08:12,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-28 10:08:12,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-28 10:08:12,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78879#(= main_~y~0 0)} is VALID [2022-04-28 10:08:12,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {78879#(= 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; {78880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:12,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {78880#(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; {78881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:12,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {78881#(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; {78882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:12,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {78882#(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; {78883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:12,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {78883#(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; {78884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:12,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {78884#(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; {78885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:12,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {78885#(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; {78886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:12,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {78886#(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; {78887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:12,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {78887#(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; {78888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:12,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {78888#(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; {78889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:12,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {78889#(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; {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:12,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {78890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78891#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:12,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {78891#(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; {78892#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:12,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {78892#(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; {78893#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:12,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {78893#(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; {78894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:12,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {78894#(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; {78895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:12,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {78895#(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; {78970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:12,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {78970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-28 10:08:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:12,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {78875#false} assume !false; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {78875#false} assume 0 == ~cond; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {78875#false} ~cond := #in~cond; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L272 TraceCheckUtils]: 37: Hoare triple {78875#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {78875#false} assume !(~y~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {78875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {78875#false} is VALID [2022-04-28 10:08:13,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {79070#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78875#false} is VALID [2022-04-28 10:08:13,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {79074#(< 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; {79070#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:13,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {79078#(< 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; {79074#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:13,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {79082#(< 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; {79078#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:13,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {79086#(< 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; {79082#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:13,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {79090#(< 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; {79086#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:13,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {79090#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:13,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {79101#(< 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; {79094#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {79105#(< 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; {79101#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {79109#(< 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; {79105#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:13,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {79113#(< 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; {79109#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:13,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {79117#(< 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; {79113#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:13,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {79121#(< 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; {79117#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:13,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {79125#(< 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; {79121#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:13,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {79129#(< 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; {79125#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:13,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {79133#(< 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; {79129#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:13,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {79137#(< 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; {79133#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:13,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {79141#(< 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; {79137#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:13,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {78874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79141#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:13,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {78874#true} call #t~ret11 := main(); {78874#true} is VALID [2022-04-28 10:08:13,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78874#true} {78874#true} #61#return; {78874#true} is VALID [2022-04-28 10:08:13,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {78874#true} assume true; {78874#true} is VALID [2022-04-28 10:08:13,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {78874#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); {78874#true} is VALID [2022-04-28 10:08:13,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {78874#true} call ULTIMATE.init(); {78874#true} is VALID [2022-04-28 10:08:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:13,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693397298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:13,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:13,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:08:13,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:13,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548497929] [2022-04-28 10:08:13,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548497929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:13,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:13,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:08:13,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345613898] [2022-04-28 10:08:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:13,148 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 41 [2022-04-28 10:08:13,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:13,148 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-28 10:08:13,167 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-28 10:08:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:08:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:08:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:08:13,168 INFO L87 Difference]: Start difference. First operand 169 states and 218 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-28 10:08:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:15,582 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2022-04-28 10:08:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:08:15,582 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 41 [2022-04-28 10:08:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:15,582 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-28 10:08:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-28 10:08:15,583 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-28 10:08:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-28 10:08:15,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2022-04-28 10:08:15,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:15,645 INFO L225 Difference]: With dead ends: 200 [2022-04-28 10:08:15,645 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 10:08:15,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=833, Invalid=3589, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:08:15,645 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:15,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 112 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:08:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 10:08:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2022-04-28 10:08:16,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:16,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,231 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,231 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,232 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2022-04-28 10:08:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 232 transitions. [2022-04-28 10:08:16,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 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 183 states. [2022-04-28 10:08:16,233 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 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 183 states. [2022-04-28 10:08:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:16,234 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2022-04-28 10:08:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 232 transitions. [2022-04-28 10:08:16,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:16,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:16,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:16,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-28 10:08:16,236 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 41 [2022-04-28 10:08:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:16,236 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-28 10:08:16,236 INFO L496 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-28 10:08:16,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 219 transitions. [2022-04-28 10:08:16,716 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-28 10:08:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-28 10:08:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:08:16,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:16,717 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:16,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-04-28 10:08:16,917 WARN L477 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-28 10:08:16,917 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 159 times [2022-04-28 10:08:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181834422] [2022-04-28 10:08:16,920 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:16,920 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 160 times [2022-04-28 10:08:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:16,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512830520] [2022-04-28 10:08:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {80344#(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); {80322#true} is VALID [2022-04-28 10:08:17,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-28 10:08:17,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-28 10:08:17,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:17,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {80344#(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); {80322#true} is VALID [2022-04-28 10:08:17,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-28 10:08:17,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-28 10:08:17,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-28 10:08:17,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80327#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {80327#(= 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; {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {80328#(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; {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:17,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {80329#(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; {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:17,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {80330#(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; {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:17,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {80331#(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; {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:17,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {80332#(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; {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:17,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {80333#(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; {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:17,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {80334#(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; {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:17,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {80335#(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; {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:17,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {80336#(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; {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:17,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {80337#(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; {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:17,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {80338#(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; {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:17,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:17,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:17,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {80340#(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; {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:17,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {80341#(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; {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:17,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {80342#(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; {80343#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {80343#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:17,192 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-28 10:08:17,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-28 10:08:17,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-28 10:08:17,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-28 10:08:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:17,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512830520] [2022-04-28 10:08:17,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512830520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:17,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090871701] [2022-04-28 10:08:17,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:17,194 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-28 10:08:17,195 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-28 10:08:17,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:17,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:17,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:08:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:17,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:17,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80322#true} is VALID [2022-04-28 10:08:17,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#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); {80322#true} is VALID [2022-04-28 10:08:17,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-28 10:08:17,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-28 10:08:17,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-28 10:08:17,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80327#(= main_~y~0 0)} is VALID [2022-04-28 10:08:17,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {80327#(= 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; {80328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:17,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {80328#(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; {80329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:17,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {80329#(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; {80330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:17,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {80330#(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; {80331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:17,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {80331#(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; {80332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:17,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {80332#(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; {80333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:17,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {80333#(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; {80334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:17,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {80334#(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; {80335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:17,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {80335#(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; {80336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:17,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {80336#(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; {80337#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:17,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {80337#(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; {80338#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:17,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {80338#(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; {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:17,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:17,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {80339#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {80340#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:17,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {80340#(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; {80341#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:17,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {80341#(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; {80342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:17,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {80342#(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; {80414#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:17,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {80414#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-28 10:08:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:17,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {80323#false} assume !false; {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {80323#false} assume 0 == ~cond; {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {80323#false} ~cond := #in~cond; {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L272 TraceCheckUtils]: 37: Hoare triple {80323#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {80323#false} assume !(~y~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {80323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {80323#false} is VALID [2022-04-28 10:08:18,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {80520#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80323#false} is VALID [2022-04-28 10:08:18,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {80524#(< 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; {80520#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:18,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {80528#(< 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; {80524#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:18,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {80532#(< 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; {80528#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:18,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {80532#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:18,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:18,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {80543#(< 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; {80536#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:18,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {80547#(< 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; {80543#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:18,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {80551#(< 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; {80547#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:18,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {80555#(< 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; {80551#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:18,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {80559#(< 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; {80555#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:18,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {80563#(< 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; {80559#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:18,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {80567#(< 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; {80563#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:18,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {80571#(< 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; {80567#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:18,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {80575#(< 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; {80571#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:18,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {80579#(< 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; {80575#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:18,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {80583#(< 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; {80579#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:18,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {80587#(< 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; {80583#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:18,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {80322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80587#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:18,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {80322#true} call #t~ret11 := main(); {80322#true} is VALID [2022-04-28 10:08:18,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80322#true} {80322#true} #61#return; {80322#true} is VALID [2022-04-28 10:08:18,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {80322#true} assume true; {80322#true} is VALID [2022-04-28 10:08:18,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {80322#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); {80322#true} is VALID [2022-04-28 10:08:18,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {80322#true} call ULTIMATE.init(); {80322#true} is VALID [2022-04-28 10:08:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:18,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090871701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:18,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:18,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:08:18,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:18,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181834422] [2022-04-28 10:08:18,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181834422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:18,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:18,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:08:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687115969] [2022-04-28 10:08:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:18,070 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 41 [2022-04-28 10:08:18,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:18,070 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-28 10:08:18,089 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-28 10:08:18,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:08:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:08:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:08:18,090 INFO L87 Difference]: Start difference. First operand 170 states and 219 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-28 10:08:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,163 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2022-04-28 10:08:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:08:20,163 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 41 [2022-04-28 10:08:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:20,163 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-28 10:08:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-04-28 10:08:20,164 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-28 10:08:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-04-28 10:08:20,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 77 transitions. [2022-04-28 10:08:20,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:20,227 INFO L225 Difference]: With dead ends: 203 [2022-04-28 10:08:20,227 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 10:08:20,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=721, Invalid=2939, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:08:20,227 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:20,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 10:08:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2022-04-28 10:08:20,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:20,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:20,782 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:20,782 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,783 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2022-04-28 10:08:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2022-04-28 10:08:20,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 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 185 states. [2022-04-28 10:08:20,784 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 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 185 states. [2022-04-28 10:08:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:20,785 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2022-04-28 10:08:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 234 transitions. [2022-04-28 10:08:20,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:20,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:20,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:20,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 166 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2022-04-28 10:08:20,787 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 41 [2022-04-28 10:08:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:20,788 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2022-04-28 10:08:20,788 INFO L496 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-28 10:08:20,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 220 transitions. [2022-04-28 10:08:21,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2022-04-28 10:08:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:08:21,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:21,255 INFO L195 NwaCegarLoop]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:21,271 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-28 10:08:21,459 WARN L477 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-28 10:08:21,459 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash 883663247, now seen corresponding path program 161 times [2022-04-28 10:08:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108150226] [2022-04-28 10:08:21,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:21,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 883663247, now seen corresponding path program 162 times [2022-04-28 10:08:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504538916] [2022-04-28 10:08:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:21,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {81804#(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); {81772#true} is VALID [2022-04-28 10:08:21,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-28 10:08:21,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-28 10:08:21,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:21,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {81804#(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); {81772#true} is VALID [2022-04-28 10:08:21,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-28 10:08:21,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-28 10:08:21,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-28 10:08:21,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81777#(= main_~y~0 0)} is VALID [2022-04-28 10:08:21,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {81777#(= 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; {81778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:21,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {81778#(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; {81779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:21,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {81779#(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; {81780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:21,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {81780#(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; {81781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:21,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {81781#(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; {81782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:21,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {81782#(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; {81783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:21,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {81783#(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; {81784#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:21,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {81784#(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; {81785#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:21,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {81785#(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; {81786#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:21,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {81786#(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; {81787#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:21,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {81787#(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; {81788#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:21,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {81788#(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; {81789#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:21,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {81789#(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; {81790#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:21,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {81790#(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; {81791#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:21,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {81791#(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; {81792#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:21,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {81792#(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; {81793#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:21,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {81793#(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; {81794#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:21,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {81794#(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; {81795#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:21,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {81795#(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; {81796#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:21,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {81796#(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; {81797#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:21,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {81797#(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; {81798#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:08:21,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {81798#(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; {81799#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:08:21,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {81799#(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; {81800#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:08:21,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {81800#(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; {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:08:21,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:08:21,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {81801#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {81802#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {81802#(and (<= main_~z~0 24) (<= 24 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; {81803#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {81803#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {81773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {81773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-28 10:08:21,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-28 10:08:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504538916] [2022-04-28 10:08:21,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504538916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94807084] [2022-04-28 10:08:21,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:21,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:21,976 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-28 10:08:21,977 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-28 10:08:22,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:22,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:22,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:08:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:22,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:22,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#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); {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {81772#true} assume !(~x~0 % 4294967296 > 0); {81772#true} is VALID [2022-04-28 10:08:22,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {81772#true} ~z~0 := ~y~0; {81901#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:08:22,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {81901#(= 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; {81905#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:08:22,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {81905#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:22,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81913#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:22,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {81913#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-28 10:08:22,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-28 10:08:22,192 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-28 10:08:22,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-28 10:08:22,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-28 10:08:22,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-28 10:08:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-28 10:08:22,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:22,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {81773#false} assume !false; {81773#false} is VALID [2022-04-28 10:08:22,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {81773#false} assume 0 == ~cond; {81773#false} is VALID [2022-04-28 10:08:22,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {81773#false} ~cond := #in~cond; {81773#false} is VALID [2022-04-28 10:08:22,342 INFO L272 TraceCheckUtils]: 37: Hoare triple {81773#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {81773#false} is VALID [2022-04-28 10:08:22,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {81773#false} assume !(~y~0 % 4294967296 > 0); {81773#false} is VALID [2022-04-28 10:08:22,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {81913#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81773#false} is VALID [2022-04-28 10:08:22,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {81913#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:22,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {81953#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {81909#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {81957#(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; {81953#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {81772#true} ~z~0 := ~y~0; {81957#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {81772#true} assume !(~x~0 % 4294967296 > 0); {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {81772#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; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {81772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {81772#true} call #t~ret11 := main(); {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81772#true} {81772#true} #61#return; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {81772#true} assume true; {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {81772#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); {81772#true} is VALID [2022-04-28 10:08:22,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {81772#true} call ULTIMATE.init(); {81772#true} is VALID [2022-04-28 10:08:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-04-28 10:08:22,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94807084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:22,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:22,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6, 6] total 36 [2022-04-28 10:08:22,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:22,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108150226] [2022-04-28 10:08:22,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108150226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:22,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:22,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:08:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966899993] [2022-04-28 10:08:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:22,348 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 41 [2022-04-28 10:08:22,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:22,348 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-28 10:08:22,372 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-28 10:08:22,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:08:22,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:08:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:08:22,373 INFO L87 Difference]: Start difference. First operand 171 states and 220 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-28 10:08:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:27,841 INFO L93 Difference]: Finished difference Result 270 states and 390 transitions. [2022-04-28 10:08:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:08:27,842 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 41 [2022-04-28 10:08:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:27,842 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-28 10:08:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 166 transitions. [2022-04-28 10:08:27,843 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-28 10:08:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 166 transitions. [2022-04-28 10:08:27,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 166 transitions. [2022-04-28 10:08:27,973 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-28 10:08:27,978 INFO L225 Difference]: With dead ends: 270 [2022-04-28 10:08:27,978 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 10:08:27,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=3819, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:08:27,978 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:27,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 193 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3166 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:08:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 10:08:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 177. [2022-04-28 10:08:28,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:28,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:28,549 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:28,549 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:28,552 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-04-28 10:08:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-04-28 10:08:28,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:28,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:28,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 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 262 states. [2022-04-28 10:08:28,552 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 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 262 states. [2022-04-28 10:08:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:28,555 INFO L93 Difference]: Finished difference Result 262 states and 321 transitions. [2022-04-28 10:08:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 321 transitions. [2022-04-28 10:08:28,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:28,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:28,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:28,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2022-04-28 10:08:28,557 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 41 [2022-04-28 10:08:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:28,557 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-04-28 10:08:28,557 INFO L496 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-28 10:08:28,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 228 transitions. [2022-04-28 10:08:29,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-28 10:08:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:29,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:29,026 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:29,041 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-28 10:08:29,226 WARN L477 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-28 10:08:29,226 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1251028863, now seen corresponding path program 163 times [2022-04-28 10:08:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857223270] [2022-04-28 10:08:29,230 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:29,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1251028863, now seen corresponding path program 164 times [2022-04-28 10:08:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:29,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384904361] [2022-04-28 10:08:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:29,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {83555#(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); {83530#true} is VALID [2022-04-28 10:08:29,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-28 10:08:29,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-28 10:08:29,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:29,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {83555#(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); {83530#true} is VALID [2022-04-28 10:08:29,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-28 10:08:29,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-28 10:08:29,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-28 10:08:29,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83535#(= main_~y~0 0)} is VALID [2022-04-28 10:08:29,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {83535#(= 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; {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:29,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {83536#(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; {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:29,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {83537#(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; {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:29,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {83538#(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; {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:29,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {83539#(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; {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:29,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {83540#(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; {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:29,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {83541#(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; {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:29,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {83542#(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; {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:29,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {83543#(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; {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:29,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:29,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {83545#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:29,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {83545#(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; {83546#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:29,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {83546#(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; {83547#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:29,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {83547#(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; {83548#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:29,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {83548#(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; {83549#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:29,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {83549#(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; {83550#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:29,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {83550#(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; {83551#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:29,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {83551#(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; {83552#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:29,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {83552#(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; {83553#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:29,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {83553#(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; {83554#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {83554#(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; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {83531#false} assume !(~z~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {83531#false} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-28 10:08:29,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-28 10:08:29,555 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-28 10:08:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:29,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384904361] [2022-04-28 10:08:29,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384904361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:29,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831620966] [2022-04-28 10:08:29,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:29,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:29,561 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-28 10:08:29,561 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-28 10:08:29,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:29,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:29,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 10:08:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:29,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:30,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83530#true} is VALID [2022-04-28 10:08:30,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#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); {83530#true} is VALID [2022-04-28 10:08:30,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-28 10:08:30,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-28 10:08:30,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-28 10:08:30,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83535#(= main_~y~0 0)} is VALID [2022-04-28 10:08:30,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {83535#(= 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; {83536#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:30,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {83536#(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; {83537#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:30,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {83537#(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; {83538#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:30,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {83538#(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; {83539#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:30,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {83539#(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; {83540#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:30,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {83540#(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; {83541#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:30,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {83541#(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; {83542#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:30,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {83542#(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; {83543#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:30,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {83543#(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; {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {83544#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {83607#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {83607#(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; {83611#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:30,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {83611#(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; {83615#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {83615#(and (= (+ main_~z~0 1) (+ (- 1) 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; {83619#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {83619#(and (= (+ main_~z~0 2) (+ (- 1) 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; {83623#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {83623#(and (= (+ main_~z~0 3) (+ (- 1) 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; {83627#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {83627#(and (= (+ main_~y~0 (- 4)) (+ 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; {83631#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {83631#(and (= (+ main_~y~0 (- 4)) (+ 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; {83635#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {83635#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)) (<= 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; {83639#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {83639#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 4)) (<= 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; {83643#(and (= (+ 5 main_~z~0) (+ main_~y~0 (- 4))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {83643#(and (= (+ 5 main_~z~0) (+ main_~y~0 (- 4))) (<= 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; {83531#false} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {83531#false} assume !(~z~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {83531#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {83531#false} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-28 10:08:30,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-28 10:08:30,075 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-28 10:08:30,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:30,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {83531#false} assume !false; {83531#false} is VALID [2022-04-28 10:08:30,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {83531#false} assume 0 == ~cond; {83531#false} is VALID [2022-04-28 10:08:30,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {83531#false} ~cond := #in~cond; {83531#false} is VALID [2022-04-28 10:08:30,829 INFO L272 TraceCheckUtils]: 38: Hoare triple {83531#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {83531#false} is VALID [2022-04-28 10:08:30,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {83704#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {83531#false} is VALID [2022-04-28 10:08:30,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {83708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83704#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:30,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {83712#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:30,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {83716#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83712#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:30,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {83720#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83716#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:30,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {83724#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83720#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:30,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {83728#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83724#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:30,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {83732#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83728#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:30,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {83736#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83732#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:08:30,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {83736#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:30,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~z~0 % 4294967296 > 0); {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:08:30,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {83747#(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; {83740#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:08:30,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {83751#(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; {83747#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:08:30,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {83755#(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; {83751#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:30,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {83759#(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; {83755#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:08:30,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {83763#(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; {83759#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:08:30,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {83767#(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; {83763#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:30,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {83771#(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; {83767#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:30,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {83775#(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; {83771#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:30,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {83779#(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; {83775#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:08:30,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {83783#(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; {83779#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:08:30,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {83530#true} ~z~0 := ~y~0; {83783#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-28 10:08:30,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {83530#true} assume !(~x~0 % 4294967296 > 0); {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {83530#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; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {83530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {83530#true} call #t~ret11 := main(); {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83530#true} {83530#true} #61#return; {83530#true} is VALID [2022-04-28 10:08:30,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {83530#true} assume true; {83530#true} is VALID [2022-04-28 10:08:30,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {83530#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); {83530#true} is VALID [2022-04-28 10:08:30,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {83530#true} call ULTIMATE.init(); {83530#true} is VALID [2022-04-28 10:08:30,856 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-28 10:08:30,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831620966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:30,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:30,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 53 [2022-04-28 10:08:30,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:30,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857223270] [2022-04-28 10:08:30,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857223270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:30,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:30,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:08:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480606981] [2022-04-28 10:08:30,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:30,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:30,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:30,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:30,885 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-28 10:08:30,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:08:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:30,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:08:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:08:30,886 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:32,630 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-28 10:08:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:08:32,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2022-04-28 10:08:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2022-04-28 10:08:32,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 47 transitions. [2022-04-28 10:08:32,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:32,674 INFO L225 Difference]: With dead ends: 192 [2022-04-28 10:08:32,674 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 10:08:32,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=813, Invalid=4443, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:08:32,675 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:32,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 10:08:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-04-28 10:08:33,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:33,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,185 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,185 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,187 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2022-04-28 10:08:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-28 10:08:33,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 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 165 states. [2022-04-28 10:08:33,187 INFO L87 Difference]: Start difference. First operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 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 165 states. [2022-04-28 10:08:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:33,188 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2022-04-28 10:08:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-28 10:08:33,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:33,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:33,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:33,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2022-04-28 10:08:33,190 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 42 [2022-04-28 10:08:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:33,191 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2022-04-28 10:08:33,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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-28 10:08:33,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 214 transitions. [2022-04-28 10:08:33,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2022-04-28 10:08:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:33,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:33,675 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:33,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:33,876 WARN L477 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-28 10:08:33,876 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 165 times [2022-04-28 10:08:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [250612076] [2022-04-28 10:08:33,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:33,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 166 times [2022-04-28 10:08:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:33,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134136277] [2022-04-28 10:08:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {84946#(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); {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:34,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {84946#(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); {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-28 10:08:34,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-28 10:08:34,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84926#(= main_~y~0 0)} is VALID [2022-04-28 10:08:34,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {84926#(= 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; {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:34,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {84927#(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; {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:34,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {84928#(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; {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:34,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {84929#(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; {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:34,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {84930#(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; {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:34,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {84931#(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; {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:34,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {84932#(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; {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {84933#(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; {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:34,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {84934#(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; {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:34,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {84935#(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; {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {84937#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:34,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {84937#(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; {84938#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:34,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {84938#(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; {84939#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:34,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {84939#(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; {84940#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:34,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {84940#(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; {84941#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:34,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {84941#(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; {84942#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:34,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {84942#(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; {84943#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:34,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {84943#(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; {84944#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:34,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {84944#(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; {84945#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {84945#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-28 10:08:34,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-28 10:08:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:08:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:34,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134136277] [2022-04-28 10:08:34,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134136277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:34,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021802377] [2022-04-28 10:08:34,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:34,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:34,205 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-28 10:08:34,206 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-28 10:08:34,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:34,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:34,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 10:08:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:34,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:34,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84921#true} is VALID [2022-04-28 10:08:34,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#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); {84921#true} is VALID [2022-04-28 10:08:34,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-28 10:08:34,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-28 10:08:34,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-28 10:08:34,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84926#(= main_~y~0 0)} is VALID [2022-04-28 10:08:34,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {84926#(= 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; {84927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:34,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {84927#(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; {84928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:34,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {84928#(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; {84929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:34,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {84929#(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; {84930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:34,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {84930#(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; {84931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:34,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {84931#(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; {84932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:34,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {84932#(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; {84933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:34,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {84933#(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; {84934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:34,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {84934#(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; {84935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:34,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {84935#(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; {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {84936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {85001#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {85001#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 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; {85005#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:34,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {85005#(and (<= main_~y~0 10) (<= 10 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; {85009#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:08:34,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {85009#(and (<= main_~y~0 10) (<= 10 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; {85013#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {85013#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {85017#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {85017#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {85021#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {85021#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 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; {85025#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:34,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {85025#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {85029#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {85029#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ 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; {85033#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {85033#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} assume !(~z~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-28 10:08:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:08:34,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:35,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {84922#false} assume !false; {84922#false} is VALID [2022-04-28 10:08:35,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {84922#false} assume 0 == ~cond; {84922#false} is VALID [2022-04-28 10:08:35,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {84922#false} ~cond := #in~cond; {84922#false} is VALID [2022-04-28 10:08:35,370 INFO L272 TraceCheckUtils]: 38: Hoare triple {84922#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {84922#false} is VALID [2022-04-28 10:08:35,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {84922#false} assume !(~y~0 % 4294967296 > 0); {84922#false} is VALID [2022-04-28 10:08:35,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {84922#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:35,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {85100#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {84922#false} is VALID [2022-04-28 10:08:35,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {85104#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85100#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:35,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {85108#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85104#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:35,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {85112#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85108#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:35,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {85116#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85112#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:35,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {85120#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85116#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:35,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {85124#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85120#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:35,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {85128#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85124#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:35,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {85132#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {85128#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:08:35,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {85136#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {85132#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:35,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {85140#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {85136#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:08:35,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {85144#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {85140#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:35,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {85148#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {85144#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:35,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {85152#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {85148#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:35,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {85156#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {85152#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:35,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {85160#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {85156#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:35,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {85164#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {85160#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:35,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {85168#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {85164#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {84921#true} ~z~0 := ~y~0; {85168#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {84921#true} assume !(~x~0 % 4294967296 > 0); {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {84921#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; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {84921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {84921#true} call #t~ret11 := main(); {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84921#true} {84921#true} #61#return; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {84921#true} assume true; {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {84921#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); {84921#true} is VALID [2022-04-28 10:08:35,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {84921#true} call ULTIMATE.init(); {84921#true} is VALID [2022-04-28 10:08:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:08:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021802377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:35,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:35,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 50 [2022-04-28 10:08:35,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [250612076] [2022-04-28 10:08:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [250612076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:35,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:35,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:08:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201807183] [2022-04-28 10:08:35,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:35,385 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 42 [2022-04-28 10:08:35,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:35,385 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-28 10:08:35,413 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-28 10:08:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:08:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:08:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:08:35,414 INFO L87 Difference]: Start difference. First operand 165 states and 214 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-28 10:08:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:37,528 INFO L93 Difference]: Finished difference Result 194 states and 243 transitions. [2022-04-28 10:08:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:08:37,528 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 42 [2022-04-28 10:08:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:37,529 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-28 10:08:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:08:37,529 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-28 10:08:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:08:37,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-28 10:08:37,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:37,577 INFO L225 Difference]: With dead ends: 194 [2022-04-28 10:08:37,577 INFO L226 Difference]: Without dead ends: 178 [2022-04-28 10:08:37,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=508, Invalid=4322, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:08:37,578 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:37,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-28 10:08:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-04-28 10:08:38,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:38,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:38,096 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:38,096 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,097 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2022-04-28 10:08:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2022-04-28 10:08:38,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 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-28 10:08:38,098 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 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-28 10:08:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,099 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2022-04-28 10:08:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2022-04-28 10:08:38,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:38,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.31055900621118) internal successors, (211), 161 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2022-04-28 10:08:38,101 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 42 [2022-04-28 10:08:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:38,101 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2022-04-28 10:08:38,101 INFO L496 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-28 10:08:38,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 215 transitions. [2022-04-28 10:08:38,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2022-04-28 10:08:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:38,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:38,556 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:38,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-04-28 10:08:38,756 WARN L477 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-28 10:08:38,756 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 167 times [2022-04-28 10:08:38,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:38,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960279594] [2022-04-28 10:08:38,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:38,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 168 times [2022-04-28 10:08:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:38,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715602220] [2022-04-28 10:08:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {86365#(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); {86341#true} is VALID [2022-04-28 10:08:39,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-28 10:08:39,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-28 10:08:39,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:39,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {86365#(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); {86341#true} is VALID [2022-04-28 10:08:39,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-28 10:08:39,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-28 10:08:39,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-28 10:08:39,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86346#(= main_~y~0 0)} is VALID [2022-04-28 10:08:39,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {86346#(= 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; {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:39,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {86347#(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; {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {86348#(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; {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:39,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {86349#(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; {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:39,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {86350#(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; {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:39,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {86351#(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; {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:39,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {86352#(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; {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:39,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {86353#(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; {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:39,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {86354#(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; {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:39,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {86355#(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; {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:39,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {86356#(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; {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:39,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:39,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:39,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {86358#(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; {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:39,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {86359#(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; {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:39,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {86360#(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; {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:39,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {86361#(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; {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:39,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {86362#(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; {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:39,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {86363#(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; {86364#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {86364#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-28 10:08:39,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-28 10:08:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:39,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715602220] [2022-04-28 10:08:39,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715602220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:39,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53925855] [2022-04-28 10:08:39,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:39,064 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-28 10:08:39,064 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-28 10:08:39,319 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:08:39,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:39,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:08:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:39,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:39,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86341#true} is VALID [2022-04-28 10:08:39,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#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); {86341#true} is VALID [2022-04-28 10:08:39,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-28 10:08:39,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-28 10:08:39,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-28 10:08:39,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86346#(= main_~y~0 0)} is VALID [2022-04-28 10:08:39,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {86346#(= 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; {86347#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:39,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {86347#(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; {86348#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:39,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {86348#(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; {86349#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:39,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {86349#(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; {86350#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:39,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {86350#(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; {86351#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:39,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {86351#(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; {86352#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:39,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {86352#(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; {86353#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:39,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {86353#(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; {86354#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:39,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {86354#(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; {86355#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:39,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {86355#(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; {86356#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:39,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {86356#(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; {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:39,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:39,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {86357#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {86358#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:39,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {86358#(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; {86359#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:39,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {86359#(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; {86360#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:39,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {86360#(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; {86361#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:39,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {86361#(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; {86362#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:39,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {86362#(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; {86363#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:39,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {86363#(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; {86441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:39,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {86441#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:39,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-28 10:08:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:39,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:40,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {86342#false} assume !false; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {86342#false} assume 0 == ~cond; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {86342#false} ~cond := #in~cond; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L272 TraceCheckUtils]: 38: Hoare triple {86342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {86342#false} assume !(~y~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {86342#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {86342#false} is VALID [2022-04-28 10:08:40,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {86541#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {86342#false} is VALID [2022-04-28 10:08:40,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {86545#(< 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; {86541#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:40,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {86549#(< 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; {86545#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:40,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {86553#(< 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; {86549#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:40,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {86557#(< 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; {86553#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:40,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {86561#(< 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; {86557#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:40,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {86565#(< 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; {86561#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:40,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {86565#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:40,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:40,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {86576#(< 0 (mod (+ 4294967291 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; {86569#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:40,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {86580#(< 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; {86576#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:40,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {86584#(< 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; {86580#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:40,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {86588#(< 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; {86584#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:40,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {86592#(< 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; {86588#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:40,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {86596#(< 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; {86592#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:40,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {86600#(< 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; {86596#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:40,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {86604#(< 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; {86600#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:40,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {86608#(< 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; {86604#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:40,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {86612#(< 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; {86608#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:40,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {86616#(< 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; {86612#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:40,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {86341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86616#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:40,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {86341#true} call #t~ret11 := main(); {86341#true} is VALID [2022-04-28 10:08:40,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86341#true} {86341#true} #61#return; {86341#true} is VALID [2022-04-28 10:08:40,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {86341#true} assume true; {86341#true} is VALID [2022-04-28 10:08:40,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {86341#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); {86341#true} is VALID [2022-04-28 10:08:40,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {86341#true} call ULTIMATE.init(); {86341#true} is VALID [2022-04-28 10:08:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:08:40,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53925855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:40,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:40,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:08:40,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:40,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960279594] [2022-04-28 10:08:40,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960279594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:40,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:40,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:08:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952231518] [2022-04-28 10:08:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:40,229 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 42 [2022-04-28 10:08:40,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:40,229 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-28 10:08:40,249 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-28 10:08:40,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:08:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:08:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:08:40,250 INFO L87 Difference]: Start difference. First operand 166 states and 215 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-28 10:08:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:42,594 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2022-04-28 10:08:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:08:42,594 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 42 [2022-04-28 10:08:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:42,595 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-28 10:08:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 10:08:42,595 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-28 10:08:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 10:08:42,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-28 10:08:42,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:42,654 INFO L225 Difference]: With dead ends: 197 [2022-04-28 10:08:42,654 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 10:08:42,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=803, Invalid=3619, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:08:42,655 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:42,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:08:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 10:08:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2022-04-28 10:08:43,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:43,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:43,178 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:43,178 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,180 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2022-04-28 10:08:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2022-04-28 10:08:43,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:43,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:43,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 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 180 states. [2022-04-28 10:08:43,180 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 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 180 states. [2022-04-28 10:08:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:43,182 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2022-04-28 10:08:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2022-04-28 10:08:43,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:43,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:43,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:43,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.308641975308642) internal successors, (212), 162 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 216 transitions. [2022-04-28 10:08:43,184 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 216 transitions. Word has length 42 [2022-04-28 10:08:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:43,184 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 216 transitions. [2022-04-28 10:08:43,184 INFO L496 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-28 10:08:43,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 216 transitions. [2022-04-28 10:08:43,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 216 transitions. [2022-04-28 10:08:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:43,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:43,615 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:43,620 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-28 10:08:43,815 WARN L477 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-28 10:08:43,815 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 169 times [2022-04-28 10:08:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:43,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97148242] [2022-04-28 10:08:43,818 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:43,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 170 times [2022-04-28 10:08:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:43,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5807759] [2022-04-28 10:08:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {87798#(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); {87775#true} is VALID [2022-04-28 10:08:44,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-28 10:08:44,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-28 10:08:44,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:44,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {87798#(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); {87775#true} is VALID [2022-04-28 10:08:44,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-28 10:08:44,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-28 10:08:44,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-28 10:08:44,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87780#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {87780#(= 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; {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {87781#(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; {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {87782#(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; {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {87783#(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; {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {87784#(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; {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:44,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {87785#(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; {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:44,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {87786#(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; {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:44,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {87787#(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; {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:44,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {87788#(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; {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:44,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {87789#(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; {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:44,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {87790#(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; {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:44,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {87791#(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; {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:44,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:44,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:44,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {87793#(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; {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:44,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {87794#(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; {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:44,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {87795#(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; {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:44,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {87796#(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; {87797#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {87797#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-28 10:08:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:44,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5807759] [2022-04-28 10:08:44,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5807759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:44,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251996620] [2022-04-28 10:08:44,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:44,107 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-28 10:08:44,108 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-28 10:08:44,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:44,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:44,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:08:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:44,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:44,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87775#true} is VALID [2022-04-28 10:08:44,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#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); {87775#true} is VALID [2022-04-28 10:08:44,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-28 10:08:44,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-28 10:08:44,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-28 10:08:44,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87780#(= main_~y~0 0)} is VALID [2022-04-28 10:08:44,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {87780#(= 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; {87781#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:44,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {87781#(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; {87782#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:44,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {87782#(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; {87783#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:44,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {87783#(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; {87784#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:44,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {87784#(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; {87785#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:44,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {87785#(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; {87786#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:44,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {87786#(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; {87787#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:44,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {87787#(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; {87788#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:44,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {87788#(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; {87789#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:44,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {87789#(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; {87790#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {87790#(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; {87791#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {87791#(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; {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:44,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:44,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {87792#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {87793#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:44,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {87793#(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; {87794#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:44,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {87794#(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; {87795#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:08:44,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {87795#(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; {87796#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {87796#(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; {87871#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {87871#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-28 10:08:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:44,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {87776#false} assume !false; {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {87776#false} assume 0 == ~cond; {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {87776#false} ~cond := #in~cond; {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L272 TraceCheckUtils]: 38: Hoare triple {87776#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {87776#false} assume !(~y~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {87776#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {87776#false} is VALID [2022-04-28 10:08:45,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {87977#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {87776#false} is VALID [2022-04-28 10:08:45,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {87981#(< 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; {87977#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:45,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {87985#(< 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; {87981#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:45,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {87989#(< 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; {87985#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:45,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {87993#(< 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; {87989#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:45,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {87993#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:45,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:45,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {88004#(< 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; {87997#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:45,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {88008#(< 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; {88004#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:45,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {88012#(< 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; {88008#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:45,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {88016#(< 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; {88012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:45,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {88020#(< 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; {88016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:45,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {88024#(< 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; {88020#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:45,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {88028#(< 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; {88024#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:45,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {88032#(< 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; {88028#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:45,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {88036#(< 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; {88032#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:45,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {88040#(< 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; {88036#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:45,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {88044#(< 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; {88040#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:45,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {88048#(< 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; {88044#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:45,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {87775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88048#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:45,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {87775#true} call #t~ret11 := main(); {87775#true} is VALID [2022-04-28 10:08:45,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87775#true} {87775#true} #61#return; {87775#true} is VALID [2022-04-28 10:08:45,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {87775#true} assume true; {87775#true} is VALID [2022-04-28 10:08:45,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {87775#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); {87775#true} is VALID [2022-04-28 10:08:45,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {87775#true} call ULTIMATE.init(); {87775#true} is VALID [2022-04-28 10:08:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:08:45,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251996620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:45,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:45,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:08:45,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:45,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97148242] [2022-04-28 10:08:45,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97148242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:45,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:45,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:08:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288071095] [2022-04-28 10:08:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:45,048 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 42 [2022-04-28 10:08:45,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:45,048 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-28 10:08:45,077 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-28 10:08:45,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:08:45,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:08:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:08:45,078 INFO L87 Difference]: Start difference. First operand 167 states and 216 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-28 10:08:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,260 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2022-04-28 10:08:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:08:47,260 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 42 [2022-04-28 10:08:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:47,260 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-28 10:08:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:08:47,261 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-28 10:08:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:08:47,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-28 10:08:47,320 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-28 10:08:47,322 INFO L225 Difference]: With dead ends: 200 [2022-04-28 10:08:47,322 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 10:08:47,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:08:47,323 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:47,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 10:08:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-04-28 10:08:47,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:47,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,861 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,861 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,862 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-04-28 10:08:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-04-28 10:08:47,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 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 182 states. [2022-04-28 10:08:47,863 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 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 182 states. [2022-04-28 10:08:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:47,864 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-04-28 10:08:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-04-28 10:08:47,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:47,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:47,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:47,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 163 states have internal predecessors, (213), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 217 transitions. [2022-04-28 10:08:47,866 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 217 transitions. Word has length 42 [2022-04-28 10:08:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 217 transitions. [2022-04-28 10:08:47,867 INFO L496 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-28 10:08:47,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 217 transitions. [2022-04-28 10:08:48,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 217 transitions. [2022-04-28 10:08:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:48,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:48,312 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:48,328 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-28 10:08:48,512 WARN L477 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-28 10:08:48,512 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 171 times [2022-04-28 10:08:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:48,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044469076] [2022-04-28 10:08:48,514 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:48,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 172 times [2022-04-28 10:08:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347205344] [2022-04-28 10:08:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:48,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {89241#(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); {89219#true} is VALID [2022-04-28 10:08:48,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-28 10:08:48,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-28 10:08:48,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:48,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {89241#(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); {89219#true} is VALID [2022-04-28 10:08:48,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-28 10:08:48,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-28 10:08:48,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-28 10:08:48,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89224#(= main_~y~0 0)} is VALID [2022-04-28 10:08:48,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {89224#(= 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; {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:48,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {89225#(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; {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:48,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {89226#(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; {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:48,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {89227#(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; {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:48,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {89228#(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; {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:48,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {89229#(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; {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:48,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {89230#(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; {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:48,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {89231#(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; {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:48,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {89232#(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; {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:48,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {89233#(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; {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:48,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {89234#(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; {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:48,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {89235#(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; {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:48,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {89236#(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; {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:48,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:48,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:08:48,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {89238#(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; {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {89239#(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; {89240#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {89240#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-28 10:08:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:08:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:48,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347205344] [2022-04-28 10:08:48,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347205344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:48,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969376170] [2022-04-28 10:08:48,782 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:48,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:48,783 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-28 10:08:48,784 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-28 10:08:48,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:48,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:48,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:08:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:48,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:49,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89219#true} is VALID [2022-04-28 10:08:49,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#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); {89219#true} is VALID [2022-04-28 10:08:49,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-28 10:08:49,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-28 10:08:49,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-28 10:08:49,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89224#(= main_~y~0 0)} is VALID [2022-04-28 10:08:49,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {89224#(= 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; {89225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:49,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {89225#(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; {89226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:49,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {89226#(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; {89227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:49,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {89227#(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; {89228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:49,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {89228#(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; {89229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:49,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {89229#(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; {89230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:49,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {89230#(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; {89231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:49,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {89231#(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; {89232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:49,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {89232#(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; {89233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:49,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {89233#(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; {89234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:49,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {89234#(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; {89235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:49,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {89235#(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; {89236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:49,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {89236#(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; {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:49,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:49,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {89237#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {89238#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:08:49,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {89238#(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; {89239#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {89239#(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; {89311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {89311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-28 10:08:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:08:49,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {89220#false} assume !false; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {89220#false} assume 0 == ~cond; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {89220#false} ~cond := #in~cond; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L272 TraceCheckUtils]: 38: Hoare triple {89220#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {89220#false} assume !(~y~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {89220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {89220#false} is VALID [2022-04-28 10:08:49,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {89423#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {89220#false} is VALID [2022-04-28 10:08:49,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {89427#(< 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; {89423#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:49,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {89431#(< 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; {89427#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:49,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {89431#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:49,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:49,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {89442#(< 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; {89435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:49,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {89446#(< 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; {89442#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:49,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {89450#(< 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; {89446#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:49,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {89454#(< 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; {89450#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:49,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {89458#(< 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; {89454#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:49,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {89462#(< 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; {89458#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:49,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {89466#(< 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; {89462#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:49,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {89470#(< 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; {89466#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:49,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {89474#(< 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; {89470#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:49,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {89478#(< 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; {89474#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:49,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {89482#(< 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; {89478#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:49,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {89486#(< 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; {89482#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:49,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {89490#(< 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; {89486#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:49,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {89219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89490#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:08:49,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {89219#true} call #t~ret11 := main(); {89219#true} is VALID [2022-04-28 10:08:49,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89219#true} {89219#true} #61#return; {89219#true} is VALID [2022-04-28 10:08:49,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {89219#true} assume true; {89219#true} is VALID [2022-04-28 10:08:49,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {89219#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); {89219#true} is VALID [2022-04-28 10:08:49,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {89219#true} call ULTIMATE.init(); {89219#true} is VALID [2022-04-28 10:08:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:08:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969376170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:49,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:08:49,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044469076] [2022-04-28 10:08:49,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044469076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:49,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:49,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:08:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588874821] [2022-04-28 10:08:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:49,686 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 42 [2022-04-28 10:08:49,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:49,686 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-28 10:08:49,704 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-28 10:08:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:08:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:08:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:08:49,705 INFO L87 Difference]: Start difference. First operand 168 states and 217 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-28 10:08:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:51,737 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2022-04-28 10:08:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:08:51,737 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 42 [2022-04-28 10:08:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:51,737 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-28 10:08:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 10:08:51,738 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-28 10:08:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 10:08:51,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-28 10:08:51,802 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-28 10:08:51,804 INFO L225 Difference]: With dead ends: 203 [2022-04-28 10:08:51,804 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 10:08:51,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=674, Invalid=2632, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:08:51,804 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:51,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 98 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:08:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 10:08:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2022-04-28 10:08:52,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:52,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,346 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,346 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,347 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2022-04-28 10:08:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2022-04-28 10:08:52,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 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 184 states. [2022-04-28 10:08:52,348 INFO L87 Difference]: Start difference. First operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 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 184 states. [2022-04-28 10:08:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:52,350 INFO L93 Difference]: Finished difference Result 184 states and 233 transitions. [2022-04-28 10:08:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2022-04-28 10:08:52,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:52,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:52,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:52,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:08:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 218 transitions. [2022-04-28 10:08:52,352 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 218 transitions. Word has length 42 [2022-04-28 10:08:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:52,352 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 218 transitions. [2022-04-28 10:08:52,352 INFO L496 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-28 10:08:52,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 218 transitions. [2022-04-28 10:08:52,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 218 transitions. [2022-04-28 10:08:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:08:52,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:52,811 INFO L195 NwaCegarLoop]: trace histogram [25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:52,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-04-28 10:08:53,011 WARN L477 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-28 10:08:53,012 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1080205710, now seen corresponding path program 173 times [2022-04-28 10:08:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:53,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306876045] [2022-04-28 10:08:53,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:53,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1080205710, now seen corresponding path program 174 times [2022-04-28 10:08:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:53,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380732617] [2022-04-28 10:08:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {90696#(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); {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:53,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {90696#(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); {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-28 10:08:53,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90668#(= main_~y~0 0)} is VALID [2022-04-28 10:08:53,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {90668#(= 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; {90669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:53,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {90669#(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; {90670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:53,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {90670#(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; {90671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:53,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {90671#(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; {90672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:53,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {90672#(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; {90673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:53,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {90673#(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; {90674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:53,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {90674#(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; {90675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:53,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {90675#(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; {90676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:53,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {90676#(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; {90677#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:53,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {90677#(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; {90678#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:53,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {90678#(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; {90679#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:53,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {90679#(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; {90680#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:53,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {90680#(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; {90681#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:53,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {90681#(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; {90682#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:53,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {90682#(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; {90683#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:53,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {90683#(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; {90684#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:53,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {90684#(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; {90685#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:53,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {90685#(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; {90686#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:53,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {90686#(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; {90687#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:53,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {90687#(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; {90688#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:53,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {90688#(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; {90689#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:08:53,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {90689#(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; {90690#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:08:53,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {90690#(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; {90691#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:08:53,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {90691#(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; {90692#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:08:53,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {90692#(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; {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:08:53,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:08:53,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {90693#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {90694#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:08:53,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {90694#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {90695#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:08:53,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {90695#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-28 10:08:53,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {90664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-28 10:08:53,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {90664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-28 10:08:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:08:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380732617] [2022-04-28 10:08:53,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380732617] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233654370] [2022-04-28 10:08:53,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:53,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:53,534 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-28 10:08:53,535 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-28 10:08:53,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:08:53,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:53,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:08:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:53,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:53,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#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); {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {90663#true} assume !(~x~0 % 4294967296 > 0); {90663#true} is VALID [2022-04-28 10:08:53,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {90663#true} ~z~0 := ~y~0; {90796#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:08:53,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {90796#(= 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; {90800#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:08:53,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {90800#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:53,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90808#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:53,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {90808#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-28 10:08:53,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-28 10:08:53,762 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-28 10:08:53,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-28 10:08:53,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-28 10:08:53,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-28 10:08:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 10:08:53,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:53,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {90664#false} assume !false; {90664#false} is VALID [2022-04-28 10:08:53,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {90664#false} assume 0 == ~cond; {90664#false} is VALID [2022-04-28 10:08:53,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {90664#false} ~cond := #in~cond; {90664#false} is VALID [2022-04-28 10:08:53,913 INFO L272 TraceCheckUtils]: 38: Hoare triple {90664#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {90664#false} is VALID [2022-04-28 10:08:53,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {90664#false} assume !(~y~0 % 4294967296 > 0); {90664#false} is VALID [2022-04-28 10:08:53,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {90808#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90664#false} is VALID [2022-04-28 10:08:53,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {90808#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:53,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {90848#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {90804#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {90852#(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; {90848#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {90663#true} ~z~0 := ~y~0; {90852#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {90663#true} assume !(~x~0 % 4294967296 > 0); {90663#true} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {90663#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; {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {90663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {90663#true} call #t~ret11 := main(); {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90663#true} {90663#true} #61#return; {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {90663#true} assume true; {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {90663#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); {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {90663#true} call ULTIMATE.init(); {90663#true} is VALID [2022-04-28 10:08:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 10:08:53,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233654370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:53,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:53,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 6, 6] total 37 [2022-04-28 10:08:53,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:53,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306876045] [2022-04-28 10:08:53,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306876045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:53,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:53,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:08:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688910009] [2022-04-28 10:08:53,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:53,919 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 42 [2022-04-28 10:08:53,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:53,919 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-28 10:08:53,942 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-28 10:08:53,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:08:53,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:53,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:08:53,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:08:53,943 INFO L87 Difference]: Start difference. First operand 169 states and 218 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-28 10:08:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,694 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2022-04-28 10:08:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:08:59,694 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 42 [2022-04-28 10:08:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:59,694 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-28 10:08:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2022-04-28 10:08:59,695 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-28 10:08:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2022-04-28 10:08:59,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 169 transitions. [2022-04-28 10:08:59,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:59,833 INFO L225 Difference]: With dead ends: 269 [2022-04-28 10:08:59,833 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 10:08:59,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=4071, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:08:59,833 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3341 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:59,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 198 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3341 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:08:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 10:09:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 175. [2022-04-28 10:09:00,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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-28 10:09:00,398 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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-28 10:09:00,399 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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-28 10:09:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,401 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-28 10:09:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-28 10:09:00,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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 261 states. [2022-04-28 10:09:00,402 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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 261 states. [2022-04-28 10:09:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,405 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-28 10:09:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-28 10:09:00,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 170 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-28 10:09:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2022-04-28 10:09:00,407 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 42 [2022-04-28 10:09:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,407 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2022-04-28 10:09:00,407 INFO L496 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-28 10:09:00,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 226 transitions. [2022-04-28 10:09:00,874 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-28 10:09:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2022-04-28 10:09:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:09:00,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:00,875 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-04-28 10:09:01,075 WARN L477 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-28 10:09:01,075 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 175 times [2022-04-28 10:09:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:01,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1895647744] [2022-04-28 10:09:01,077 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:01,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 176 times [2022-04-28 10:09:01,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:01,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586564464] [2022-04-28 10:09:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {92448#(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); {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:01,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {92448#(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); {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-28 10:09:01,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92427#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {92427#(= 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; {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {92428#(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; {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {92429#(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; {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:01,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {92430#(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; {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:01,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {92431#(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; {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:01,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {92432#(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; {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:01,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {92433#(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; {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:01,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {92434#(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; {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:01,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {92435#(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; {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:01,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {92436#(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; {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {92438#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:01,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {92438#(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; {92439#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:01,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {92439#(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; {92440#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:01,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {92440#(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; {92441#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {92441#(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; {92442#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:01,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {92442#(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; {92443#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:01,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {92443#(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; {92444#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:01,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {92444#(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; {92445#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:01,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {92445#(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; {92446#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {92446#(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; {92447#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {92447#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-28 10:09:01,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-28 10:09:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586564464] [2022-04-28 10:09:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586564464] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863750618] [2022-04-28 10:09:01,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:01,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:01,426 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-28 10:09:01,426 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-28 10:09:01,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:01,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-28 10:09:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:01,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92422#true} is VALID [2022-04-28 10:09:01,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#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); {92422#true} is VALID [2022-04-28 10:09:01,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-28 10:09:01,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-28 10:09:01,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-28 10:09:01,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92427#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {92427#(= 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; {92428#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {92428#(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; {92429#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:01,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {92429#(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; {92430#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:01,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {92430#(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; {92431#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:01,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {92431#(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; {92432#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:01,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {92432#(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; {92433#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:01,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {92433#(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; {92434#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:01,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {92434#(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; {92435#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:01,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {92435#(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; {92436#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:01,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {92436#(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; {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {92437#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {92503#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {92503#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 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; {92507#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:01,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {92507#(and (<= main_~y~0 10) (<= 10 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; {92511#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {92511#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 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; {92515#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {92515#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {92519#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:09:01,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {92519#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {92523#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {92523#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 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; {92527#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {92527#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 10 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; {92531#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:01,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {92531#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ 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; {92535#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:09:01,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {92535#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ 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; {92539#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:01,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {92539#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {92423#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-28 10:09:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:01,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:02,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {92423#false} assume !false; {92423#false} is VALID [2022-04-28 10:09:02,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {92423#false} assume 0 == ~cond; {92423#false} is VALID [2022-04-28 10:09:02,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {92423#false} ~cond := #in~cond; {92423#false} is VALID [2022-04-28 10:09:02,725 INFO L272 TraceCheckUtils]: 39: Hoare triple {92423#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {92423#false} is VALID [2022-04-28 10:09:02,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {92423#false} assume !(~y~0 % 4294967296 > 0); {92423#false} is VALID [2022-04-28 10:09:02,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {92603#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92423#false} is VALID [2022-04-28 10:09:02,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {92607#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92603#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:02,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {92611#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92607#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:02,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {92615#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92611#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:02,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {92619#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92615#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:02,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {92623#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92619#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:02,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {92627#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92623#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:02,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {92631#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92627#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:02,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {92635#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92631#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:09:02,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {92639#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {92635#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:02,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {92643#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {92639#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:09:02,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {92647#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {92643#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:02,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {92651#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92647#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:02,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {92655#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {92651#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:02,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {92659#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92655#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:02,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {92663#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92659#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:02,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {92667#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92663#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:02,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {92671#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92667#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:02,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {92675#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92671#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:09:02,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {92679#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {92675#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {92422#true} ~z~0 := ~y~0; {92679#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {92422#true} assume !(~x~0 % 4294967296 > 0); {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {92422#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; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {92422#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {92422#true} call #t~ret11 := main(); {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92422#true} {92422#true} #61#return; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {92422#true} assume true; {92422#true} is VALID [2022-04-28 10:09:02,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {92422#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); {92422#true} is VALID [2022-04-28 10:09:02,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {92422#true} call ULTIMATE.init(); {92422#true} is VALID [2022-04-28 10:09:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863750618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:02,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 54 [2022-04-28 10:09:02,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1895647744] [2022-04-28 10:09:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1895647744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:02,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:09:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298554019] [2022-04-28 10:09:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:02,741 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 43 [2022-04-28 10:09:02,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:02,742 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-28 10:09:02,764 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-28 10:09:02,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:09:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:09:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:09:02,765 INFO L87 Difference]: Start difference. First operand 175 states and 226 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-28 10:09:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,799 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2022-04-28 10:09:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:09:04,799 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 43 [2022-04-28 10:09:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:04,799 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-28 10:09:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:09:04,800 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-28 10:09:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:09:04,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2022-04-28 10:09:04,847 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-28 10:09:04,849 INFO L225 Difference]: With dead ends: 204 [2022-04-28 10:09:04,849 INFO L226 Difference]: Without dead ends: 188 [2022-04-28 10:09:04,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 10:09:04,849 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:04,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-28 10:09:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2022-04-28 10:09:05,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:05,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:05,432 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:05,433 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:05,434 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2022-04-28 10:09:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2022-04-28 10:09:05,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:05,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:05,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 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 188 states. [2022-04-28 10:09:05,435 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 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 188 states. [2022-04-28 10:09:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:05,437 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2022-04-28 10:09:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2022-04-28 10:09:05,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:05,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:05,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:05,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2022-04-28 10:09:05,439 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 43 [2022-04-28 10:09:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:05,439 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2022-04-28 10:09:05,439 INFO L496 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-28 10:09:05,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 227 transitions. [2022-04-28 10:09:05,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2022-04-28 10:09:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:09:05,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:05,914 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:05,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-04-28 10:09:06,114 WARN L477 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-28 10:09:06,114 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 177 times [2022-04-28 10:09:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:06,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575057027] [2022-04-28 10:09:06,117 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:06,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 178 times [2022-04-28 10:09:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:06,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725173264] [2022-04-28 10:09:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {93939#(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); {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:06,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {93939#(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); {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-28 10:09:06,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-28 10:09:06,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93919#(= main_~y~0 0)} is VALID [2022-04-28 10:09:06,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {93919#(= 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; {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:06,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {93920#(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; {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {93921#(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; {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {93922#(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; {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:06,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {93923#(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; {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:06,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {93924#(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; {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:06,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {93925#(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; {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:06,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {93926#(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; {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:06,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {93927#(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; {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:06,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {93928#(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; {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:06,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {93929#(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; {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:06,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:06,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:06,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {93931#(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; {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:06,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {93932#(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; {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:06,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#(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; {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:06,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {93934#(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; {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:06,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {93935#(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; {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:06,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {93936#(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; {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:06,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {93937#(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; {93938#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {93938#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-28 10:09:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:09:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725173264] [2022-04-28 10:09:06,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725173264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447353697] [2022-04-28 10:09:06,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:06,458 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-28 10:09:06,459 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-28 10:09:06,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:06,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:06,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:06,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:06,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93914#true} is VALID [2022-04-28 10:09:06,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#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); {93914#true} is VALID [2022-04-28 10:09:06,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-28 10:09:06,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-28 10:09:06,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-28 10:09:06,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93919#(= main_~y~0 0)} is VALID [2022-04-28 10:09:06,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {93919#(= 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; {93920#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:06,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {93920#(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; {93921#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {93921#(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; {93922#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {93922#(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; {93923#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:06,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {93923#(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; {93924#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:06,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {93924#(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; {93925#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:06,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {93925#(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; {93926#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:06,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {93926#(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; {93927#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:06,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {93927#(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; {93928#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:06,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {93928#(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; {93929#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:06,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {93929#(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; {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:06,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:06,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {93930#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93931#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:06,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {93931#(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; {93932#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:06,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {93932#(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; {93933#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:06,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#(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; {93934#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:06,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {93934#(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; {93935#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:06,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {93935#(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; {93936#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:06,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {93936#(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; {93937#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:06,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {93937#(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; {94018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {94018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-28 10:09:06,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-28 10:09:06,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-28 10:09:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:09:06,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:07,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {93915#false} assume !false; {93915#false} is VALID [2022-04-28 10:09:07,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {93915#false} assume 0 == ~cond; {93915#false} is VALID [2022-04-28 10:09:07,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {93915#false} ~cond := #in~cond; {93915#false} is VALID [2022-04-28 10:09:07,453 INFO L272 TraceCheckUtils]: 39: Hoare triple {93915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {93915#false} is VALID [2022-04-28 10:09:07,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {93915#false} assume !(~y~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:07,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {93915#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {93915#false} is VALID [2022-04-28 10:09:07,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {94118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {93915#false} is VALID [2022-04-28 10:09:07,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {94122#(< 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; {94118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:07,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {94126#(< 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; {94122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:07,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {94130#(< 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; {94126#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:07,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {94134#(< 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; {94130#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:07,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {94138#(< 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; {94134#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:07,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {94142#(< 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; {94138#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:07,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {94146#(< 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; {94142#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:07,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {94146#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:09:07,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:09:07,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {94157#(< 0 (mod (+ 4294967290 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; {94150#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:09:07,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {94161#(< 0 (mod (+ 4294967291 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; {94157#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:07,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {94165#(< 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; {94161#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:07,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {94169#(< 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; {94165#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:07,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {94173#(< 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; {94169#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:07,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {94177#(< 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; {94173#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:07,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {94181#(< 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; {94177#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:07,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {94185#(< 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; {94181#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:07,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {94189#(< 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; {94185#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:07,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {94193#(< 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; {94189#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:07,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {94197#(< 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; {94193#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:07,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {93914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94197#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:07,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {93914#true} call #t~ret11 := main(); {93914#true} is VALID [2022-04-28 10:09:07,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93914#true} {93914#true} #61#return; {93914#true} is VALID [2022-04-28 10:09:07,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {93914#true} assume true; {93914#true} is VALID [2022-04-28 10:09:07,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {93914#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); {93914#true} is VALID [2022-04-28 10:09:07,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {93914#true} call ULTIMATE.init(); {93914#true} is VALID [2022-04-28 10:09:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:09:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447353697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:07,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:07,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:07,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575057027] [2022-04-28 10:09:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575057027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:07,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:07,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772056739] [2022-04-28 10:09:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:07,468 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 43 [2022-04-28 10:09:07,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:07,468 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-28 10:09:07,489 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-28 10:09:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:07,490 INFO L87 Difference]: Start difference. First operand 176 states and 227 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-28 10:09:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,919 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2022-04-28 10:09:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:09:09,919 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 43 [2022-04-28 10:09:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:09,919 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-28 10:09:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 10:09:09,920 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-28 10:09:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 10:09:09,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-04-28 10:09:09,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:09,978 INFO L225 Difference]: With dead ends: 207 [2022-04-28 10:09:09,978 INFO L226 Difference]: Without dead ends: 190 [2022-04-28 10:09:09,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=879, Invalid=4091, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:09:09,979 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:09,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-28 10:09:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2022-04-28 10:09:10,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:10,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:10,557 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:10,557 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,559 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2022-04-28 10:09:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2022-04-28 10:09:10,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 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 190 states. [2022-04-28 10:09:10,560 INFO L87 Difference]: Start difference. First operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 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 190 states. [2022-04-28 10:09:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,562 INFO L93 Difference]: Finished difference Result 190 states and 241 transitions. [2022-04-28 10:09:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2022-04-28 10:09:10,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:10,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2022-04-28 10:09:10,565 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 43 [2022-04-28 10:09:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:10,565 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2022-04-28 10:09:10,566 INFO L496 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-28 10:09:10,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 228 transitions. [2022-04-28 10:09:11,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-28 10:09:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:09:11,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:11,035 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:11,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-04-28 10:09:11,235 WARN L477 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-28 10:09:11,235 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 179 times [2022-04-28 10:09:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302298234] [2022-04-28 10:09:11,238 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:11,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 180 times [2022-04-28 10:09:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:11,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820133085] [2022-04-28 10:09:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {95444#(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); {95420#true} is VALID [2022-04-28 10:09:11,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-28 10:09:11,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-28 10:09:11,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:11,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {95444#(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); {95420#true} is VALID [2022-04-28 10:09:11,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-28 10:09:11,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-28 10:09:11,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-28 10:09:11,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95425#(= main_~y~0 0)} is VALID [2022-04-28 10:09:11,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {95425#(= 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; {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:11,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {95426#(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; {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:11,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {95427#(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; {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {95428#(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; {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:11,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {95429#(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; {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:11,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {95430#(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; {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:11,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {95431#(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; {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:11,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {95432#(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; {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:11,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {95433#(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; {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:11,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {95434#(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; {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:11,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {95435#(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; {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:11,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {95436#(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; {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:11,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:11,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:11,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {95438#(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; {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:11,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {95439#(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; {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:11,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {95440#(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; {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:11,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {95441#(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; {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:11,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {95442#(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; {95443#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {95443#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:11,543 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-28 10:09:11,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-28 10:09:11,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-28 10:09:11,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-28 10:09:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:11,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820133085] [2022-04-28 10:09:11,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820133085] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:11,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54686105] [2022-04-28 10:09:11,544 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:11,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:11,545 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-28 10:09:11,546 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-28 10:09:11,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:09:11,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:11,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:09:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:12,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95420#true} is VALID [2022-04-28 10:09:12,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#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); {95420#true} is VALID [2022-04-28 10:09:12,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-28 10:09:12,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-28 10:09:12,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-28 10:09:12,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95425#(= main_~y~0 0)} is VALID [2022-04-28 10:09:12,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {95425#(= 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; {95426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:12,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {95426#(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; {95427#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:12,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {95427#(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; {95428#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:12,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {95428#(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; {95429#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:12,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {95429#(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; {95430#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:12,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {95430#(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; {95431#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:12,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {95431#(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; {95432#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:12,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {95432#(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; {95433#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:12,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {95433#(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; {95434#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:12,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {95434#(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; {95435#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:12,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {95435#(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; {95436#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:12,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {95436#(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; {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:12,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:12,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {95437#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {95438#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:12,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {95438#(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; {95439#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:12,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {95439#(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; {95440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:12,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {95440#(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; {95441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:12,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {95441#(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; {95442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:12,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {95442#(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; {95520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:12,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {95520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-28 10:09:12,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-28 10:09:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:12,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:12,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {95421#false} assume !false; {95421#false} is VALID [2022-04-28 10:09:12,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {95421#false} assume 0 == ~cond; {95421#false} is VALID [2022-04-28 10:09:12,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {95421#false} ~cond := #in~cond; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L272 TraceCheckUtils]: 39: Hoare triple {95421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {95421#false} assume !(~y~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {95421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {95421#false} is VALID [2022-04-28 10:09:12,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {95626#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {95421#false} is VALID [2022-04-28 10:09:12,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {95630#(< 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; {95626#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:12,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {95634#(< 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; {95630#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:12,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {95638#(< 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; {95634#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:12,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {95642#(< 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; {95638#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:12,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {95646#(< 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; {95642#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:12,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {95646#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:12,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:12,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {95657#(< 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; {95650#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:12,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {95661#(< 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; {95657#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:12,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {95665#(< 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; {95661#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:12,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {95669#(< 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; {95665#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:12,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {95673#(< 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; {95669#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:12,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {95677#(< 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; {95673#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:12,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {95681#(< 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; {95677#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:12,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {95685#(< 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; {95681#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:12,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {95689#(< 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; {95685#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:12,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {95693#(< 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; {95689#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:12,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {95697#(< 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; {95693#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:12,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {95701#(< 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; {95697#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:12,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {95420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95701#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:12,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {95420#true} call #t~ret11 := main(); {95420#true} is VALID [2022-04-28 10:09:12,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95420#true} {95420#true} #61#return; {95420#true} is VALID [2022-04-28 10:09:12,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {95420#true} assume true; {95420#true} is VALID [2022-04-28 10:09:12,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {95420#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); {95420#true} is VALID [2022-04-28 10:09:12,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {95420#true} call ULTIMATE.init(); {95420#true} is VALID [2022-04-28 10:09:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:12,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54686105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:12,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:12,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:09:12,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:12,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302298234] [2022-04-28 10:09:12,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302298234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:12,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:12,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:09:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449476586] [2022-04-28 10:09:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:12,724 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 43 [2022-04-28 10:09:12,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:12,724 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-28 10:09:12,744 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-28 10:09:12,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:09:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:09:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:09:12,745 INFO L87 Difference]: Start difference. First operand 177 states and 228 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-28 10:09:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:15,243 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-04-28 10:09:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:09:15,244 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 43 [2022-04-28 10:09:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:15,244 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-28 10:09:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-28 10:09:15,245 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-28 10:09:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-28 10:09:15,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2022-04-28 10:09:15,307 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-28 10:09:15,308 INFO L225 Difference]: With dead ends: 210 [2022-04-28 10:09:15,309 INFO L226 Difference]: Without dead ends: 192 [2022-04-28 10:09:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=906, Invalid=3924, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:09:15,309 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:15,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-28 10:09:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2022-04-28 10:09:15,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:15,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,914 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,914 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:15,916 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-04-28 10:09:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-04-28 10:09:15,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:15,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:15,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 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 192 states. [2022-04-28 10:09:15,916 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 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 192 states. [2022-04-28 10:09:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:15,918 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2022-04-28 10:09:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-04-28 10:09:15,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:15,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:15,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:15,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.300578034682081) internal successors, (225), 173 states have internal predecessors, (225), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 229 transitions. [2022-04-28 10:09:15,920 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 229 transitions. Word has length 43 [2022-04-28 10:09:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:15,920 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 229 transitions. [2022-04-28 10:09:15,920 INFO L496 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-28 10:09:15,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 229 transitions. [2022-04-28 10:09:16,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 229 transitions. [2022-04-28 10:09:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:09:16,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:16,426 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:16,432 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-28 10:09:16,626 WARN L477 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-28 10:09:16,626 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 181 times [2022-04-28 10:09:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:16,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575177691] [2022-04-28 10:09:16,631 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:16,631 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 182 times [2022-04-28 10:09:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:16,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123955620] [2022-04-28 10:09:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:16,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {96961#(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); {96938#true} is VALID [2022-04-28 10:09:16,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-28 10:09:16,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-28 10:09:16,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:16,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {96961#(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); {96938#true} is VALID [2022-04-28 10:09:16,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-28 10:09:16,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-28 10:09:16,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-28 10:09:16,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {96943#(= main_~y~0 0)} is VALID [2022-04-28 10:09:16,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {96943#(= 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; {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:16,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {96944#(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; {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:16,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {96945#(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; {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:16,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {96946#(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; {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:16,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {96947#(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; {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:16,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {96948#(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; {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:16,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {96949#(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; {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:16,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {96950#(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; {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:16,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {96951#(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; {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:16,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {96952#(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; {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:16,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {96953#(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; {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:16,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {96954#(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; {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:16,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {96955#(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; {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:16,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:16,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:16,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {96957#(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; {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:16,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {96958#(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; {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:16,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {96959#(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; {96960#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {96960#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:16,921 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-28 10:09:16,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-28 10:09:16,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-28 10:09:16,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-28 10:09:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123955620] [2022-04-28 10:09:16,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123955620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369578455] [2022-04-28 10:09:16,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:16,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:16,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:16,923 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-28 10:09:16,924 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-28 10:09:16,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:16,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:16,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:09:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:16,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:17,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96938#true} is VALID [2022-04-28 10:09:17,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#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); {96938#true} is VALID [2022-04-28 10:09:17,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-28 10:09:17,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-28 10:09:17,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-28 10:09:17,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {96943#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {96943#(= 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; {96944#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {96944#(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; {96945#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {96945#(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; {96946#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {96946#(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; {96947#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {96947#(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; {96948#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {96948#(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; {96949#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:17,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {96949#(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; {96950#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:17,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {96950#(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; {96951#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:17,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {96951#(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; {96952#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:17,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {96952#(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; {96953#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:17,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {96953#(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; {96954#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:17,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {96954#(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; {96955#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:17,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {96955#(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; {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:17,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:17,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {96956#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {96957#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:17,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {96957#(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; {96958#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:17,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {96958#(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; {96959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:17,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {96959#(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; {97034#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:17,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {97034#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:17,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-28 10:09:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:17,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:17,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {96939#false} assume !false; {96939#false} is VALID [2022-04-28 10:09:17,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {96939#false} assume 0 == ~cond; {96939#false} is VALID [2022-04-28 10:09:17,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {96939#false} ~cond := #in~cond; {96939#false} is VALID [2022-04-28 10:09:17,866 INFO L272 TraceCheckUtils]: 39: Hoare triple {96939#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {96939#false} assume !(~y~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {96939#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {96939#false} is VALID [2022-04-28 10:09:17,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {97146#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {96939#false} is VALID [2022-04-28 10:09:17,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {97150#(< 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; {97146#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:17,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {97154#(< 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; {97150#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:17,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {97158#(< 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; {97154#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:17,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {97158#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:17,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:17,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {97169#(< 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; {97162#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:17,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {97173#(< 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; {97169#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:17,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {97177#(< 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; {97173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:17,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {97181#(< 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; {97177#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:17,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {97185#(< 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; {97181#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {97189#(< 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; {97185#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {97193#(< 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; {97189#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {97197#(< 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; {97193#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {97201#(< 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; {97197#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:17,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {97205#(< 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; {97201#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:17,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {97209#(< 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; {97205#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:17,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {97213#(< 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; {97209#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:17,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {97217#(< 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; {97213#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:17,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {96938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {97217#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:17,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {96938#true} call #t~ret11 := main(); {96938#true} is VALID [2022-04-28 10:09:17,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96938#true} {96938#true} #61#return; {96938#true} is VALID [2022-04-28 10:09:17,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {96938#true} assume true; {96938#true} is VALID [2022-04-28 10:09:17,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {96938#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); {96938#true} is VALID [2022-04-28 10:09:17,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {96938#true} call ULTIMATE.init(); {96938#true} is VALID [2022-04-28 10:09:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:17,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369578455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:17,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:17,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:09:17,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:17,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575177691] [2022-04-28 10:09:17,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575177691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:17,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:17,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:09:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143587565] [2022-04-28 10:09:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:17,880 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 43 [2022-04-28 10:09:17,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:17,880 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-28 10:09:17,900 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-28 10:09:17,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:09:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:09:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:17,901 INFO L87 Difference]: Start difference. First operand 178 states and 229 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-28 10:09:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,330 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2022-04-28 10:09:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:09:20,330 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 43 [2022-04-28 10:09:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:20,331 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-28 10:09:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-28 10:09:20,331 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-28 10:09:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-28 10:09:20,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2022-04-28 10:09:20,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,397 INFO L225 Difference]: With dead ends: 213 [2022-04-28 10:09:20,397 INFO L226 Difference]: Without dead ends: 194 [2022-04-28 10:09:20,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:09:20,398 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:20,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 109 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-28 10:09:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2022-04-28 10:09:21,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:21,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:21,006 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:21,006 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:21,009 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2022-04-28 10:09:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2022-04-28 10:09:21,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:21,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:21,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 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 194 states. [2022-04-28 10:09:21,009 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 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 194 states. [2022-04-28 10:09:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:21,012 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2022-04-28 10:09:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2022-04-28 10:09:21,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:21,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:21,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:21,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 174 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2022-04-28 10:09:21,015 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 43 [2022-04-28 10:09:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:21,015 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2022-04-28 10:09:21,016 INFO L496 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-28 10:09:21,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 230 transitions. [2022-04-28 10:09:21,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2022-04-28 10:09:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:09:21,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:21,514 INFO L195 NwaCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:21,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-04-28 10:09:21,714 WARN L477 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-28 10:09:21,714 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1416912529, now seen corresponding path program 183 times [2022-04-28 10:09:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:21,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853422715] [2022-04-28 10:09:21,717 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:21,717 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1416912529, now seen corresponding path program 184 times [2022-04-28 10:09:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:21,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483100841] [2022-04-28 10:09:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {98492#(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); {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:22,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {98492#(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); {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-28 10:09:22,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-28 10:09:22,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98463#(= main_~y~0 0)} is VALID [2022-04-28 10:09:22,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {98463#(= 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; {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:22,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {98464#(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; {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:22,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {98465#(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; {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:22,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {98466#(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; {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:22,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {98467#(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; {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:22,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {98468#(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; {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {98469#(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; {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:22,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {98470#(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; {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:22,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {98471#(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; {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:22,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {98472#(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; {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:22,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {98473#(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; {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:22,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {98474#(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; {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {98475#(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; {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:22,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {98476#(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; {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:22,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {98477#(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; {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:22,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {98478#(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; {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:22,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {98479#(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; {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:22,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {98480#(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; {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:22,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {98481#(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; {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:22,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {98482#(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; {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:22,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {98483#(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; {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:22,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {98484#(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; {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:22,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {98485#(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; {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:09:22,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {98486#(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; {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:09:22,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {98487#(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; {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:09:22,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {98488#(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; {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:09:22,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:09:22,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {98490#(and (<= main_~z~0 26) (<= 26 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; {98491#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {98491#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-28 10:09:22,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-28 10:09:22,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-28 10:09:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:22,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:22,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483100841] [2022-04-28 10:09:22,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483100841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:22,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063879603] [2022-04-28 10:09:22,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:22,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:22,302 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-28 10:09:22,302 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-28 10:09:22,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:22,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:22,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 10:09:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:22,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98458#true} is VALID [2022-04-28 10:09:22,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#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); {98458#true} is VALID [2022-04-28 10:09:22,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-28 10:09:22,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-28 10:09:22,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-28 10:09:22,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98463#(= main_~y~0 0)} is VALID [2022-04-28 10:09:22,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {98463#(= 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; {98464#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:22,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {98464#(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; {98465#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:22,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {98465#(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; {98466#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:22,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {98466#(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; {98467#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:22,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {98467#(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; {98468#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:22,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {98468#(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; {98469#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {98469#(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; {98470#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:22,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {98470#(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; {98471#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:22,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {98471#(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; {98472#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:22,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {98472#(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; {98473#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:22,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {98473#(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; {98474#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:22,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {98474#(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; {98475#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:22,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {98475#(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; {98476#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:22,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {98476#(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; {98477#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:22,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {98477#(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; {98478#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:22,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {98478#(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; {98479#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:22,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {98479#(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; {98480#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:22,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {98480#(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; {98481#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:22,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {98481#(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; {98482#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:22,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {98482#(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; {98483#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:22,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {98483#(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; {98484#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:22,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {98484#(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; {98485#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:22,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {98485#(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; {98486#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:09:22,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {98486#(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; {98487#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:09:22,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {98487#(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; {98488#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:09:22,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {98488#(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; {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:09:22,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:09:22,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {98489#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {98490#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:09:22,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {98490#(and (<= main_~z~0 26) (<= 26 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; {98598#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:09:22,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {98598#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:22,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:22,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-28 10:09:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:22,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {98459#false} assume !false; {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 41: Hoare triple {98459#false} assume 0 == ~cond; {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {98459#false} ~cond := #in~cond; {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L272 TraceCheckUtils]: 39: Hoare triple {98459#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {98459#false} assume !(~y~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {98459#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {98459#false} is VALID [2022-04-28 10:09:24,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {98644#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {98459#false} is VALID [2022-04-28 10:09:24,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {98648#(< 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; {98644#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:24,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {98648#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {98659#(< 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; {98652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:24,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {98663#(< 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; {98659#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:24,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {98667#(< 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; {98663#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:24,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {98671#(< 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; {98667#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:24,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {98675#(< 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; {98671#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:24,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {98679#(< 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; {98675#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:24,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {98683#(< 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; {98679#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:24,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {98687#(< 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; {98683#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:24,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {98691#(< 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; {98687#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:24,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {98695#(< 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; {98691#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:24,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {98699#(< 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; {98695#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:24,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {98703#(< 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; {98699#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:24,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {98707#(< 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; {98703#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:24,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {98711#(< 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; {98707#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:24,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {98715#(< 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; {98711#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:24,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {98719#(< 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; {98715#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:24,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {98723#(< 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; {98719#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:09:24,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {98727#(< 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; {98723#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:09:24,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {98731#(< 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; {98727#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:09:24,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {98735#(< 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; {98731#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:09:24,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {98739#(< 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; {98735#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:24,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {98743#(< 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; {98739#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:09:24,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {98747#(< 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; {98743#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:09:24,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {98751#(< 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; {98747#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:09:24,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {98755#(< 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; {98751#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:24,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {98759#(< 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; {98755#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:09:24,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {98458#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98759#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:09:24,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {98458#true} call #t~ret11 := main(); {98458#true} is VALID [2022-04-28 10:09:24,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98458#true} {98458#true} #61#return; {98458#true} is VALID [2022-04-28 10:09:24,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {98458#true} assume true; {98458#true} is VALID [2022-04-28 10:09:24,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {98458#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); {98458#true} is VALID [2022-04-28 10:09:24,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {98458#true} call ULTIMATE.init(); {98458#true} is VALID [2022-04-28 10:09:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:24,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063879603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:24,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:24,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 10:09:24,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:24,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853422715] [2022-04-28 10:09:24,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853422715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:24,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:24,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 10:09:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229655553] [2022-04-28 10:09:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:24,066 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 43 [2022-04-28 10:09:24,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:24,066 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-28 10:09:24,092 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-28 10:09:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 10:09:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 10:09:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=2926, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:09:24,093 INFO L87 Difference]: Start difference. First operand 179 states and 230 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-28 10:09:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:30,366 INFO L93 Difference]: Finished difference Result 280 states and 404 transitions. [2022-04-28 10:09:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:09:30,366 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 43 [2022-04-28 10:09:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:30,366 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-28 10:09:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2022-04-28 10:09:30,367 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-28 10:09:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 176 transitions. [2022-04-28 10:09:30,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 176 transitions. [2022-04-28 10:09:30,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:30,514 INFO L225 Difference]: With dead ends: 280 [2022-04-28 10:09:30,514 INFO L226 Difference]: Without dead ends: 272 [2022-04-28 10:09:30,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1798, Invalid=6574, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 10:09:30,515 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:30,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 206 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 10:09:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-28 10:09:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 185. [2022-04-28 10:09:31,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:31,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,152 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,152 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,155 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2022-04-28 10:09:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2022-04-28 10:09:31,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 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 272 states. [2022-04-28 10:09:31,155 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 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 272 states. [2022-04-28 10:09:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,158 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2022-04-28 10:09:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 333 transitions. [2022-04-28 10:09:31,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:31,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.3) internal successors, (234), 180 states have internal predecessors, (234), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2022-04-28 10:09:31,160 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 43 [2022-04-28 10:09:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:31,160 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2022-04-28 10:09:31,160 INFO L496 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-28 10:09:31,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 238 transitions. [2022-04-28 10:09:31,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2022-04-28 10:09:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:09:31,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:31,697 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:31,714 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-28 10:09:31,898 WARN L477 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-28 10:09:31,898 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 185 times [2022-04-28 10:09:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495408675] [2022-04-28 10:09:31,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:31,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 186 times [2022-04-28 10:09:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:31,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277853691] [2022-04-28 10:09:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {100332#(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); {100314#true} is VALID [2022-04-28 10:09:32,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-28 10:09:32,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {100332#(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); {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= 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; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= 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; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= 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; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= 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; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= 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; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:32,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= 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; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= 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; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:32,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:32,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:32,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:32,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:32,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,198 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:32,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {100330#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {100331#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:32,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {100331#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {100315#false} is VALID [2022-04-28 10:09:32,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-28 10:09:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277853691] [2022-04-28 10:09:32,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277853691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308808350] [2022-04-28 10:09:32,199 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:32,200 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-28 10:09:32,201 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-28 10:09:32,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:09:32,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:32,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:09:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:32,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#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); {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:32,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= 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; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= 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; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= 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; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= 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; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= 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; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:32,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= 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; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= 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; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:32,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:32,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:32,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:32,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:32,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:32,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:32,909 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:32,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {100460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:32,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {100460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {100315#false} is VALID [2022-04-28 10:09:32,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-28 10:09:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:32,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:33,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {100315#false} assume !false; {100315#false} is VALID [2022-04-28 10:09:33,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {100460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {100315#false} is VALID [2022-04-28 10:09:33,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {100460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:33,237 INFO L272 TraceCheckUtils]: 40: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {100456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:33,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:33,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:33,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:33,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:33,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:33,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:33,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {100329#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:09:33,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {100328#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:09:33,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {100327#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {100325#(<= 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; {100326#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {100324#(<= 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; {100325#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {100323#(<= 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; {100324#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:09:33,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {100322#(<= 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; {100323#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {100321#(<= 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; {100322#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {100320#(<= 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; {100321#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:33,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {100319#(<= 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; {100320#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:33,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:33,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {100314#true} assume !(~x~0 % 4294967296 > 0); {100319#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:33,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {100314#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; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {100314#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {100314#true} call #t~ret11 := main(); {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100314#true} {100314#true} #61#return; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {100314#true} assume true; {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {100314#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); {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {100314#true} call ULTIMATE.init(); {100314#true} is VALID [2022-04-28 10:09:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:33,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308808350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:33,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:33,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2022-04-28 10:09:33,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:33,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495408675] [2022-04-28 10:09:33,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495408675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:33,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:33,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062254548] [2022-04-28 10:09:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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 44 [2022-04-28 10:09:33,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:33,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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-28 10:09:33,296 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-28 10:09:33,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:33,296 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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-28 10:09:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,037 INFO L93 Difference]: Finished difference Result 584 states and 780 transitions. [2022-04-28 10:09:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:09:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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 44 [2022-04-28 10:09:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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-28 10:09:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 10:09:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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-28 10:09:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2022-04-28 10:09:38,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2022-04-28 10:09:38,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,125 INFO L225 Difference]: With dead ends: 584 [2022-04-28 10:09:38,125 INFO L226 Difference]: Without dead ends: 568 [2022-04-28 10:09:38,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:09:38,125 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:38,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 108 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-28 10:09:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 189. [2022-04-28 10:09:38,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:38,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:09:38,784 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:09:38,784 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:09:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,793 INFO L93 Difference]: Finished difference Result 568 states and 763 transitions. [2022-04-28 10:09:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 763 transitions. [2022-04-28 10:09:38,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:38,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:38,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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 568 states. [2022-04-28 10:09:38,794 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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 568 states. [2022-04-28 10:09:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,805 INFO L93 Difference]: Finished difference Result 568 states and 763 transitions. [2022-04-28 10:09:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 763 transitions. [2022-04-28 10:09:38,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:38,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:38,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:38,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:09:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2022-04-28 10:09:38,808 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 244 transitions. Word has length 44 [2022-04-28 10:09:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:38,808 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 244 transitions. [2022-04-28 10:09:38,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 14 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-28 10:09:38,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 244 transitions. [2022-04-28 10:09:39,411 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-28 10:09:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 244 transitions. [2022-04-28 10:09:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:09:39,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:39,412 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:39,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:39,612 WARN L477 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-28 10:09:39,613 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 187 times [2022-04-28 10:09:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:39,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1078430658] [2022-04-28 10:09:39,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:39,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 188 times [2022-04-28 10:09:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:39,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656899583] [2022-04-28 10:09:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:39,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {103332#(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); {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:39,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {103332#(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); {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-28 10:09:39,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-28 10:09:39,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103311#(= main_~y~0 0)} is VALID [2022-04-28 10:09:39,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {103311#(= 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; {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:39,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {103312#(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; {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:39,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {103313#(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; {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:39,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {103314#(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; {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:39,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {103315#(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; {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:39,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {103316#(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; {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:39,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {103317#(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; {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:39,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {103318#(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; {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:39,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {103319#(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; {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:39,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {103320#(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; {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:39,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {103321#(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; {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:39,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:39,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {103323#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:39,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {103323#(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; {103324#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:39,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {103324#(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; {103325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:39,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {103325#(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; {103326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:39,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {103326#(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; {103327#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:39,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {103327#(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; {103328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:39,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {103328#(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; {103329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:39,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {103329#(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; {103330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:39,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {103330#(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; {103331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {103331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:39,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-28 10:09:39,965 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-28 10:09:39,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-28 10:09:39,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-28 10:09:39,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-28 10:09:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:09:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:39,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656899583] [2022-04-28 10:09:39,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656899583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:39,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492902956] [2022-04-28 10:09:39,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:39,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:39,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:39,967 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-28 10:09:39,968 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-28 10:09:40,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:40,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 10:09:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:40,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103306#true} is VALID [2022-04-28 10:09:40,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#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); {103306#true} is VALID [2022-04-28 10:09:40,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-28 10:09:40,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-28 10:09:40,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-28 10:09:40,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103311#(= main_~y~0 0)} is VALID [2022-04-28 10:09:40,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {103311#(= 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; {103312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:40,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {103312#(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; {103313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:40,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {103313#(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; {103314#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:40,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {103314#(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; {103315#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:40,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {103315#(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; {103316#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:40,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {103316#(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; {103317#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:40,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {103317#(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; {103318#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:40,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {103318#(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; {103319#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:40,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {103319#(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; {103320#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:40,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {103320#(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; {103321#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:40,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {103321#(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; {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {103322#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {103390#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {103390#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 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; {103394#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:40,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {103394#(and (<= main_~y~0 11) (<= 11 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; {103398#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {103398#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 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; {103402#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {103402#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 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; {103406#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:09:40,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {103406#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {103410#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {103410#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 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; {103414#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {103414#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 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; {103418#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {103418#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 11 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; {103422#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:40,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {103422#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-28 10:09:40,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-28 10:09:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:09:40,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {103307#false} assume !false; {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {103307#false} assume 0 == ~cond; {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {103307#false} ~cond := #in~cond; {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L272 TraceCheckUtils]: 40: Hoare triple {103307#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {103307#false} assume !(~y~0 % 4294967296 > 0); {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:41,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {103307#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:41,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {103495#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103307#false} is VALID [2022-04-28 10:09:41,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {103499#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103495#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:41,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {103503#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103499#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:41,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {103507#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103503#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:41,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {103511#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103507#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:41,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {103515#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103511#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:41,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {103519#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103515#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:41,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {103523#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103519#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:41,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {103527#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {103523#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:09:41,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {103531#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {103527#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:41,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {103535#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {103531#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:41,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {103539#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {103535#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:41,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {103543#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 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; {103539#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:41,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {103547#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {103543#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:41,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {103551#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {103547#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:41,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {103555#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {103551#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:41,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {103559#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {103555#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:41,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {103563#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {103559#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {103306#true} ~z~0 := ~y~0; {103563#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {103306#true} assume !(~x~0 % 4294967296 > 0); {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {103306#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; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {103306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {103306#true} is VALID [2022-04-28 10:09:41,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {103306#true} call #t~ret11 := main(); {103306#true} is VALID [2022-04-28 10:09:41,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103306#true} {103306#true} #61#return; {103306#true} is VALID [2022-04-28 10:09:41,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {103306#true} assume true; {103306#true} is VALID [2022-04-28 10:09:41,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {103306#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); {103306#true} is VALID [2022-04-28 10:09:41,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {103306#true} call ULTIMATE.init(); {103306#true} is VALID [2022-04-28 10:09:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:09:41,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492902956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:41,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 51 [2022-04-28 10:09:41,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:41,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1078430658] [2022-04-28 10:09:41,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1078430658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:41,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:09:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288499317] [2022-04-28 10:09:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:41,205 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 44 [2022-04-28 10:09:41,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:41,205 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-28 10:09:41,227 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-28 10:09:41,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:09:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:09:41,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:09:41,228 INFO L87 Difference]: Start difference. First operand 189 states and 244 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-28 10:09:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,171 INFO L93 Difference]: Finished difference Result 220 states and 275 transitions. [2022-04-28 10:09:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:09:44,171 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 44 [2022-04-28 10:09:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:44,171 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-28 10:09:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-28 10:09:44,171 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-28 10:09:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-28 10:09:44,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 74 transitions. [2022-04-28 10:09:44,230 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-28 10:09:44,232 INFO L225 Difference]: With dead ends: 220 [2022-04-28 10:09:44,232 INFO L226 Difference]: Without dead ends: 203 [2022-04-28 10:09:44,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=642, Invalid=5678, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:09:44,233 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:44,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-28 10:09:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 190. [2022-04-28 10:09:44,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:44,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:44,902 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:44,902 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,904 INFO L93 Difference]: Finished difference Result 203 states and 258 transitions. [2022-04-28 10:09:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2022-04-28 10:09:44,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 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 203 states. [2022-04-28 10:09:44,905 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 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 203 states. [2022-04-28 10:09:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,906 INFO L93 Difference]: Finished difference Result 203 states and 258 transitions. [2022-04-28 10:09:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2022-04-28 10:09:44,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:44,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2022-04-28 10:09:44,909 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 44 [2022-04-28 10:09:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:44,909 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2022-04-28 10:09:44,909 INFO L496 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-28 10:09:44,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 245 transitions. [2022-04-28 10:09:45,494 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-28 10:09:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2022-04-28 10:09:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:09:45,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:45,495 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:45,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:45,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:45,695 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 189 times [2022-04-28 10:09:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:45,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3719867] [2022-04-28 10:09:45,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:45,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 190 times [2022-04-28 10:09:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:45,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877972210] [2022-04-28 10:09:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {104932#(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); {104907#true} is VALID [2022-04-28 10:09:46,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-28 10:09:46,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-28 10:09:46,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:46,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {104932#(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); {104907#true} is VALID [2022-04-28 10:09:46,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-28 10:09:46,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-28 10:09:46,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-28 10:09:46,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104912#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {104912#(= 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; {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {104913#(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; {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {104914#(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; {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {104915#(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; {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {104916#(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; {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {104917#(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; {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {104918#(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; {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:46,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {104919#(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; {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:46,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {104920#(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; {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {104921#(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; {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:46,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#(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; {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:46,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {104923#(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; {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:46,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:46,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:46,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {104925#(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; {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:46,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {104926#(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; {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:46,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {104927#(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; {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:46,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {104928#(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; {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:46,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {104929#(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; {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {104930#(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; {104931#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {104931#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-28 10:09:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:46,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877972210] [2022-04-28 10:09:46,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877972210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:46,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901821136] [2022-04-28 10:09:46,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:46,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:46,080 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:46,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-04-28 10:09:46,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:46,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:46,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:46,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104907#true} is VALID [2022-04-28 10:09:46,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#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); {104907#true} is VALID [2022-04-28 10:09:46,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-28 10:09:46,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-28 10:09:46,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-28 10:09:46,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104912#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {104912#(= 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; {104913#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {104913#(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; {104914#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {104914#(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; {104915#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {104915#(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; {104916#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {104916#(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; {104917#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {104917#(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; {104918#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {104918#(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; {104919#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:46,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {104919#(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; {104920#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:46,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {104920#(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; {104921#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {104921#(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; {104922#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:46,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {104922#(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; {104923#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:46,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {104923#(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; {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:46,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:46,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {104924#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {104925#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:46,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {104925#(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; {104926#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:46,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {104926#(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; {104927#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:46,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {104927#(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; {104928#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:46,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {104928#(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; {104929#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:46,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {104929#(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; {104930#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:46,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {104930#(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; {105011#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {105011#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-28 10:09:46,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-28 10:09:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:46,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {104908#false} assume !false; {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {104908#false} assume 0 == ~cond; {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {104908#false} ~cond := #in~cond; {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L272 TraceCheckUtils]: 40: Hoare triple {104908#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {104908#false} assume !(~y~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {104908#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {104908#false} is VALID [2022-04-28 10:09:47,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {105117#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104908#false} is VALID [2022-04-28 10:09:47,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {105121#(< 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; {105117#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:47,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {105125#(< 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; {105121#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {105129#(< 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; {105125#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:47,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {105133#(< 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; {105129#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:47,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {105137#(< 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; {105133#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:47,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {105141#(< 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; {105137#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:47,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {105141#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:47,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {105152#(< 0 (mod (+ 4294967291 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; {105145#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {105156#(< 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; {105152#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {105160#(< 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; {105156#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {105164#(< 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; {105160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:47,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {105168#(< 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; {105164#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:47,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {105172#(< 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; {105168#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {105176#(< 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; {105172#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:47,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {105180#(< 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; {105176#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:47,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {105184#(< 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; {105180#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:47,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {105188#(< 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; {105184#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:47,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {105192#(< 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; {105188#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:47,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {105196#(< 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; {105192#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {104907#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {105196#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:47,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {104907#true} call #t~ret11 := main(); {104907#true} is VALID [2022-04-28 10:09:47,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104907#true} {104907#true} #61#return; {104907#true} is VALID [2022-04-28 10:09:47,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {104907#true} assume true; {104907#true} is VALID [2022-04-28 10:09:47,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {104907#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); {104907#true} is VALID [2022-04-28 10:09:47,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {104907#true} call ULTIMATE.init(); {104907#true} is VALID [2022-04-28 10:09:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:09:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901821136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:47,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:47,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:09:47,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:47,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3719867] [2022-04-28 10:09:47,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3719867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:47,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:47,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334976203] [2022-04-28 10:09:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:47,128 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 44 [2022-04-28 10:09:47,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:47,129 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-28 10:09:47,150 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-28 10:09:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:47,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:47,151 INFO L87 Difference]: Start difference. First operand 190 states and 245 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-28 10:09:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,883 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2022-04-28 10:09:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:09:49,883 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 44 [2022-04-28 10:09:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:49,883 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-28 10:09:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-28 10:09:49,884 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-28 10:09:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-28 10:09:49,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-28 10:09:49,946 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-28 10:09:49,949 INFO L225 Difference]: With dead ends: 223 [2022-04-28 10:09:49,949 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 10:09:49,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1017, Invalid=4533, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 10:09:49,950 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:49,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 10:09:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2022-04-28 10:09:50,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:50,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,626 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,626 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,628 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-04-28 10:09:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-04-28 10:09:50,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 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 205 states. [2022-04-28 10:09:50,628 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 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 205 states. [2022-04-28 10:09:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,630 INFO L93 Difference]: Finished difference Result 205 states and 260 transitions. [2022-04-28 10:09:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2022-04-28 10:09:50,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:50,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 186 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2022-04-28 10:09:50,633 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 44 [2022-04-28 10:09:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:50,633 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2022-04-28 10:09:50,633 INFO L496 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-28 10:09:50,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 246 transitions. [2022-04-28 10:09:51,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2022-04-28 10:09:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:09:51,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:51,205 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:51,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-04-28 10:09:51,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:51,406 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 191 times [2022-04-28 10:09:51,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929141569] [2022-04-28 10:09:51,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:51,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 192 times [2022-04-28 10:09:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:51,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748014523] [2022-04-28 10:09:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {106541#(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); {106517#true} is VALID [2022-04-28 10:09:51,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-28 10:09:51,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-28 10:09:51,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:51,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {106541#(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); {106517#true} is VALID [2022-04-28 10:09:51,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-28 10:09:51,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-28 10:09:51,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-28 10:09:51,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106522#(= main_~y~0 0)} is VALID [2022-04-28 10:09:51,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {106522#(= 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; {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:51,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {106523#(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; {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:51,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {106524#(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; {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:51,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {106525#(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; {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:51,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {106526#(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; {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:51,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {106527#(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; {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:51,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {106528#(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; {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:51,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {106529#(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; {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:51,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {106530#(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; {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:51,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {106531#(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; {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:51,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {106532#(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; {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:51,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {106533#(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; {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:51,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {106534#(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; {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:51,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:51,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:51,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {106536#(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; {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:51,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {106537#(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; {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:51,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(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; {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:51,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {106539#(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; {106540#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {106540#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-28 10:09:51,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-28 10:09:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748014523] [2022-04-28 10:09:51,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748014523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015626777] [2022-04-28 10:09:51,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:51,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:51,770 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:51,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-04-28 10:09:52,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:09:52,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:52,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:09:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:52,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:52,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106517#true} is VALID [2022-04-28 10:09:52,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#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); {106517#true} is VALID [2022-04-28 10:09:52,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-28 10:09:52,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-28 10:09:52,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-28 10:09:52,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106522#(= main_~y~0 0)} is VALID [2022-04-28 10:09:52,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {106522#(= 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; {106523#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:52,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {106523#(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; {106524#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:52,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {106524#(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; {106525#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:52,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {106525#(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; {106526#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:52,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {106526#(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; {106527#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:52,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {106527#(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; {106528#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:52,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {106528#(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; {106529#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:52,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {106529#(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; {106530#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:52,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {106530#(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; {106531#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:52,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {106531#(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; {106532#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:52,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {106532#(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; {106533#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:52,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {106533#(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; {106534#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:52,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {106534#(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; {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:52,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:52,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {106535#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {106536#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:52,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {106536#(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; {106537#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:52,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {106537#(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; {106538#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:09:52,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(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; {106539#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:52,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {106539#(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; {106617#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {106617#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-28 10:09:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:52,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {106518#false} assume !false; {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {106518#false} assume 0 == ~cond; {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {106518#false} ~cond := #in~cond; {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L272 TraceCheckUtils]: 40: Hoare triple {106518#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {106518#false} assume !(~y~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {106518#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {106518#false} is VALID [2022-04-28 10:09:53,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {106729#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {106518#false} is VALID [2022-04-28 10:09:53,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {106733#(< 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; {106729#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:53,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {106737#(< 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; {106733#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:53,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {106741#(< 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; {106737#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:53,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {106745#(< 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; {106741#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:53,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {106745#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:53,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {106756#(< 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; {106749#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {106760#(< 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; {106756#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:53,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {106764#(< 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; {106760#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:53,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {106768#(< 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; {106764#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:53,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {106772#(< 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; {106768#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:53,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {106776#(< 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; {106772#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:53,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {106780#(< 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; {106776#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:53,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {106784#(< 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; {106780#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:53,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {106788#(< 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; {106784#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:53,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {106792#(< 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; {106788#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {106796#(< 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; {106792#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:53,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {106800#(< 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; {106796#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:53,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {106804#(< 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; {106800#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:53,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {106517#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {106804#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:53,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {106517#true} call #t~ret11 := main(); {106517#true} is VALID [2022-04-28 10:09:53,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106517#true} {106517#true} #61#return; {106517#true} is VALID [2022-04-28 10:09:53,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {106517#true} assume true; {106517#true} is VALID [2022-04-28 10:09:53,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {106517#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); {106517#true} is VALID [2022-04-28 10:09:53,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {106517#true} call ULTIMATE.init(); {106517#true} is VALID [2022-04-28 10:09:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:09:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015626777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:53,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:09:53,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929141569] [2022-04-28 10:09:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929141569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:53,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:09:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172696468] [2022-04-28 10:09:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:53,338 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 44 [2022-04-28 10:09:53,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:53,338 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-28 10:09:53,359 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-28 10:09:53,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:09:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:09:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:09:53,360 INFO L87 Difference]: Start difference. First operand 191 states and 246 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-28 10:09:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:55,978 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-04-28 10:09:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:09:55,978 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 44 [2022-04-28 10:09:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:55,978 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-28 10:09:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 83 transitions. [2022-04-28 10:09:55,979 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-28 10:09:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 83 transitions. [2022-04-28 10:09:55,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 83 transitions. [2022-04-28 10:09:56,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:56,053 INFO L225 Difference]: With dead ends: 226 [2022-04-28 10:09:56,053 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 10:09:56,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=924, Invalid=3906, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:09:56,053 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:56,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 104 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:09:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 10:09:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2022-04-28 10:09:56,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:56,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,733 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,734 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,736 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2022-04-28 10:09:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2022-04-28 10:09:56,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 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 207 states. [2022-04-28 10:09:56,736 INFO L87 Difference]: Start difference. First operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 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 207 states. [2022-04-28 10:09:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,738 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2022-04-28 10:09:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2022-04-28 10:09:56,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:56,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 187 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2022-04-28 10:09:56,740 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 44 [2022-04-28 10:09:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:56,741 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2022-04-28 10:09:56,741 INFO L496 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-28 10:09:56,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 192 states and 247 transitions. [2022-04-28 10:09:57,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2022-04-28 10:09:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:09:57,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:57,316 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:57,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-04-28 10:09:57,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-04-28 10:09:57,517 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash 917310221, now seen corresponding path program 193 times [2022-04-28 10:09:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:57,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692641429] [2022-04-28 10:09:57,519 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:57,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 917310221, now seen corresponding path program 194 times [2022-04-28 10:09:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689673129] [2022-04-28 10:09:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {108154#(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); {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:57,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {108154#(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); {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-28 10:09:57,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108136#(= main_~y~0 0)} is VALID [2022-04-28 10:09:57,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {108136#(= 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; {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:57,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {108137#(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; {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:57,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {108138#(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; {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:57,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {108139#(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; {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:57,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {108140#(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; {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:57,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {108141#(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; {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:57,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {108142#(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; {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:57,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {108143#(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; {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:57,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {108144#(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; {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:57,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {108145#(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; {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:57,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {108146#(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; {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:57,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {108147#(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; {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:57,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {108148#(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; {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:57,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {108149#(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; {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:57,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:57,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:09:57,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:57,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {108152#(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; {108153#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:57,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {108153#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:57,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-28 10:09:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:09:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:57,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689673129] [2022-04-28 10:09:57,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689673129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:57,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181972063] [2022-04-28 10:09:57,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:57,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:57,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:57,810 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:57,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-04-28 10:09:57,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:57,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:57,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:09:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:58,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108131#true} is VALID [2022-04-28 10:09:58,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#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); {108131#true} is VALID [2022-04-28 10:09:58,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-28 10:09:58,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-28 10:09:58,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-28 10:09:58,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108136#(= main_~y~0 0)} is VALID [2022-04-28 10:09:58,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {108136#(= 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; {108137#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:58,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {108137#(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; {108138#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:58,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {108138#(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; {108139#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:58,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {108139#(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; {108140#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:58,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {108140#(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; {108141#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:58,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {108141#(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; {108142#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:58,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {108142#(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; {108143#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:58,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {108143#(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; {108144#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:58,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {108144#(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; {108145#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:58,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {108145#(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; {108146#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:58,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {108146#(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; {108147#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:58,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {108147#(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; {108148#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:58,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {108148#(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; {108149#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:58,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {108149#(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; {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:58,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:58,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {108150#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:09:58,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {108151#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108152#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {108152#(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; {108227#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {108227#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-28 10:09:58,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-28 10:09:58,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-28 10:09:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:09:58,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {108132#false} assume !false; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {108132#false} assume 0 == ~cond; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {108132#false} ~cond := #in~cond; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L272 TraceCheckUtils]: 40: Hoare triple {108132#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {108132#false} assume !(~y~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {108132#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {108132#false} is VALID [2022-04-28 10:09:58,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {108345#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {108132#false} is VALID [2022-04-28 10:09:58,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {108349#(< 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; {108345#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:58,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {108353#(< 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; {108349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:58,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {108353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:58,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:58,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {108364#(< 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; {108357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:58,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {108368#(< 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; {108364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:58,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {108372#(< 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; {108368#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:58,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {108376#(< 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; {108372#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {108380#(< 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; {108376#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {108384#(< 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; {108380#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {108388#(< 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; {108384#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {108392#(< 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; {108388#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:58,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {108396#(< 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; {108392#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:58,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {108400#(< 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; {108396#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:58,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {108404#(< 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; {108400#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:58,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {108408#(< 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; {108404#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:58,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {108412#(< 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; {108408#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:58,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {108416#(< 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; {108412#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:58,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {108131#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108416#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:58,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {108131#true} call #t~ret11 := main(); {108131#true} is VALID [2022-04-28 10:09:58,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108131#true} {108131#true} #61#return; {108131#true} is VALID [2022-04-28 10:09:58,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {108131#true} assume true; {108131#true} is VALID [2022-04-28 10:09:58,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {108131#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); {108131#true} is VALID [2022-04-28 10:09:58,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {108131#true} call ULTIMATE.init(); {108131#true} is VALID [2022-04-28 10:09:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:09:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181972063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:58,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:09:58,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692641429] [2022-04-28 10:09:58,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692641429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:58,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:58,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:09:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503583295] [2022-04-28 10:09:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:58,763 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 44 [2022-04-28 10:09:58,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:58,763 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-28 10:09:58,782 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-28 10:09:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:09:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:09:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:58,783 INFO L87 Difference]: Start difference. First operand 192 states and 247 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-28 10:10:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,201 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2022-04-28 10:10:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:10:01,201 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 44 [2022-04-28 10:10:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:01,201 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-28 10:10:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2022-04-28 10:10:01,202 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-28 10:10:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2022-04-28 10:10:01,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 81 transitions. [2022-04-28 10:10:01,267 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-28 10:10:01,269 INFO L225 Difference]: With dead ends: 229 [2022-04-28 10:10:01,269 INFO L226 Difference]: Without dead ends: 209 [2022-04-28 10:10:01,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=746, Invalid=2914, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:10:01,269 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:01,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 106 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:10:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-28 10:10:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2022-04-28 10:10:01,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:01,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:01,959 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:01,959 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,961 INFO L93 Difference]: Finished difference Result 209 states and 264 transitions. [2022-04-28 10:10:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-04-28 10:10:01,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 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 209 states. [2022-04-28 10:10:01,961 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 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 209 states. [2022-04-28 10:10:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,963 INFO L93 Difference]: Finished difference Result 209 states and 264 transitions. [2022-04-28 10:10:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-04-28 10:10:01,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:01,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2022-04-28 10:10:01,966 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 44 [2022-04-28 10:10:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:01,966 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2022-04-28 10:10:01,966 INFO L496 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-28 10:10:01,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 248 transitions. [2022-04-28 10:10:02,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2022-04-28 10:10:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:10:02,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:02,557 INFO L195 NwaCegarLoop]: trace histogram [27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:02,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-04-28 10:10:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:02,758 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1518166610, now seen corresponding path program 195 times [2022-04-28 10:10:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:02,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932969574] [2022-04-28 10:10:02,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:02,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1518166610, now seen corresponding path program 196 times [2022-04-28 10:10:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:02,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883751576] [2022-04-28 10:10:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {109776#(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); {109741#true} is VALID [2022-04-28 10:10:03,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-28 10:10:03,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-28 10:10:03,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:03,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {109776#(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); {109741#true} is VALID [2022-04-28 10:10:03,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-28 10:10:03,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-28 10:10:03,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-28 10:10:03,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109746#(= main_~y~0 0)} is VALID [2022-04-28 10:10:03,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {109746#(= 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; {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {109747#(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; {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {109748#(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; {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:03,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {109749#(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; {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:03,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {109750#(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; {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:03,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {109751#(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; {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:03,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {109752#(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; {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:03,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {109753#(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; {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:03,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {109754#(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; {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:03,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {109755#(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; {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:03,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {109756#(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; {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {109757#(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; {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:03,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {109758#(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; {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:03,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {109759#(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; {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:03,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {109760#(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; {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:03,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {109761#(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; {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:03,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {109762#(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; {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:03,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {109763#(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; {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:03,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {109764#(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; {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:03,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {109765#(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; {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:03,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {109766#(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; {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:03,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {109767#(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; {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:03,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {109768#(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; {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:03,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {109769#(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; {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:10:03,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {109770#(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; {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:10:03,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {109771#(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; {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:10:03,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {109772#(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; {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:03,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:03,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:10:03,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {109774#(and (<= main_~z~0 27) (<= 27 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; {109775#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {109775#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-28 10:10:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883751576] [2022-04-28 10:10:03,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883751576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613317893] [2022-04-28 10:10:03,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:03,361 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:03,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-04-28 10:10:03,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:03,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:03,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 10:10:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:03,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109741#true} is VALID [2022-04-28 10:10:03,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#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); {109741#true} is VALID [2022-04-28 10:10:03,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-28 10:10:03,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-28 10:10:03,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-28 10:10:03,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109746#(= main_~y~0 0)} is VALID [2022-04-28 10:10:03,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {109746#(= 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; {109747#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {109747#(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; {109748#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {109748#(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; {109749#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:03,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {109749#(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; {109750#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:03,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {109750#(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; {109751#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:03,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {109751#(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; {109752#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:03,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {109752#(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; {109753#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:03,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {109753#(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; {109754#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:03,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {109754#(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; {109755#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:03,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {109755#(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; {109756#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:03,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {109756#(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; {109757#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {109757#(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; {109758#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:03,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {109758#(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; {109759#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:03,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {109759#(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; {109760#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:03,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {109760#(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; {109761#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:03,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {109761#(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; {109762#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:03,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {109762#(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; {109763#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:03,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {109763#(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; {109764#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:03,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {109764#(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; {109765#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:03,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {109765#(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; {109766#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:03,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {109766#(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; {109767#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:03,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {109767#(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; {109768#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:03,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {109768#(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; {109769#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:03,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {109769#(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; {109770#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:10:03,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {109770#(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; {109771#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:10:03,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {109771#(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; {109772#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:10:03,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {109772#(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; {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:03,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:03,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {109773#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {109774#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {109774#(and (<= main_~z~0 27) (<= 27 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; {109885#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {109885#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-28 10:10:03,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-28 10:10:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:03,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {109742#false} assume !false; {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {109742#false} assume 0 == ~cond; {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {109742#false} ~cond := #in~cond; {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L272 TraceCheckUtils]: 40: Hoare triple {109742#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {109742#false} assume !(~y~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {109742#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {109742#false} is VALID [2022-04-28 10:10:05,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {109931#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {109742#false} is VALID [2022-04-28 10:10:05,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {109935#(< 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; {109931#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:05,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {109935#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:05,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:05,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {109946#(< 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; {109939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:05,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {109950#(< 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; {109946#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:05,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {109954#(< 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; {109950#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:05,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {109958#(< 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; {109954#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:05,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {109962#(< 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; {109958#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:05,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {109966#(< 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; {109962#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:05,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {109970#(< 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; {109966#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:05,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {109974#(< 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; {109970#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:05,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {109978#(< 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; {109974#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:05,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {109982#(< 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; {109978#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:05,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {109986#(< 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; {109982#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:05,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {109990#(< 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; {109986#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:05,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {109994#(< 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; {109990#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:05,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {109998#(< 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; {109994#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:05,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {110002#(< 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; {109998#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:05,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {110006#(< 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; {110002#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:05,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {110010#(< 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; {110006#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:05,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {110014#(< 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; {110010#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:05,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {110018#(< 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; {110014#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:10:05,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {110022#(< 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; {110018#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:10:05,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {110026#(< 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; {110022#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:05,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {110030#(< 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; {110026#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:10:05,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {110034#(< 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; {110030#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:10:05,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {110038#(< 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; {110034#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:10:05,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {110042#(< 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; {110038#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:05,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {110046#(< 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; {110042#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:10:05,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {110050#(< 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; {110046#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:10:05,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {109741#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {110050#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:10:05,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {109741#true} call #t~ret11 := main(); {109741#true} is VALID [2022-04-28 10:10:05,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109741#true} {109741#true} #61#return; {109741#true} is VALID [2022-04-28 10:10:05,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {109741#true} assume true; {109741#true} is VALID [2022-04-28 10:10:05,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {109741#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); {109741#true} is VALID [2022-04-28 10:10:05,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {109741#true} call ULTIMATE.init(); {109741#true} is VALID [2022-04-28 10:10:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:05,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613317893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:05,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:05,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 10:10:05,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:05,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932969574] [2022-04-28 10:10:05,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932969574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:05,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:05,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 10:10:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557963052] [2022-04-28 10:10:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:05,208 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 44 [2022-04-28 10:10:05,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:05,208 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-28 10:10:05,233 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-28 10:10:05,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 10:10:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 10:10:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=3117, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:10:05,234 INFO L87 Difference]: Start difference. First operand 193 states and 248 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-28 10:10:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:12,015 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2022-04-28 10:10:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:10:12,015 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 44 [2022-04-28 10:10:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:12,015 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-28 10:10:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 183 transitions. [2022-04-28 10:10:12,016 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-28 10:10:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 183 transitions. [2022-04-28 10:10:12,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 183 transitions. [2022-04-28 10:10:12,164 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-28 10:10:12,170 INFO L225 Difference]: With dead ends: 307 [2022-04-28 10:10:12,170 INFO L226 Difference]: Without dead ends: 299 [2022-04-28 10:10:12,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1919, Invalid=7011, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 10:10:12,170 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 155 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:12,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 214 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3937 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 10:10:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-28 10:10:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 199. [2022-04-28 10:10:12,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:12,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:12,887 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:12,887 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:12,890 INFO L93 Difference]: Finished difference Result 299 states and 365 transitions. [2022-04-28 10:10:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2022-04-28 10:10:12,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:12,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:12,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 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 299 states. [2022-04-28 10:10:12,890 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 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 299 states. [2022-04-28 10:10:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:12,894 INFO L93 Difference]: Finished difference Result 299 states and 365 transitions. [2022-04-28 10:10:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2022-04-28 10:10:12,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:12,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:12,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:12,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 256 transitions. [2022-04-28 10:10:12,896 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 256 transitions. Word has length 44 [2022-04-28 10:10:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:12,896 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 256 transitions. [2022-04-28 10:10:12,896 INFO L496 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-28 10:10:12,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 256 transitions. [2022-04-28 10:10:13,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 256 transitions. [2022-04-28 10:10:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:13,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:13,478 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:13,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-04-28 10:10:13,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-04-28 10:10:13,678 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 197 times [2022-04-28 10:10:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:13,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927563919] [2022-04-28 10:10:13,681 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:13,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 198 times [2022-04-28 10:10:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906338983] [2022-04-28 10:10:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {111770#(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); {111743#true} is VALID [2022-04-28 10:10:14,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-28 10:10:14,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-28 10:10:14,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:14,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {111770#(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); {111743#true} is VALID [2022-04-28 10:10:14,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-28 10:10:14,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-28 10:10:14,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-28 10:10:14,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111748#(= main_~y~0 0)} is VALID [2022-04-28 10:10:14,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {111748#(= 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; {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:14,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {111749#(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; {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:14,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {111750#(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; {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:14,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {111751#(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; {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:14,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {111752#(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; {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:14,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {111753#(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; {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:14,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {111754#(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; {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:14,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {111755#(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; {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:14,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {111756#(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; {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:14,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {111757#(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; {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {111759#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:14,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {111759#(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; {111760#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:14,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {111760#(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; {111761#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:14,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {111761#(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; {111762#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:14,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {111762#(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; {111763#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:14,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {111763#(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; {111764#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:14,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {111764#(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; {111765#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:14,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {111765#(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; {111766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:14,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {111766#(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; {111767#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:14,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {111767#(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; {111768#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {111768#(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; {111769#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {111769#(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; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {111744#false} assume !(~z~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {111744#false} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-28 10:10:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906338983] [2022-04-28 10:10:14,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906338983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:14,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155492895] [2022-04-28 10:10:14,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:14,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:14,064 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:14,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-04-28 10:10:14,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:10:14,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:14,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 10:10:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:14,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:14,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111743#true} is VALID [2022-04-28 10:10:14,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#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); {111743#true} is VALID [2022-04-28 10:10:14,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-28 10:10:14,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-28 10:10:14,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-28 10:10:14,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111748#(= main_~y~0 0)} is VALID [2022-04-28 10:10:14,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {111748#(= 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; {111749#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:14,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {111749#(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; {111750#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:14,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {111750#(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; {111751#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:14,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {111751#(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; {111752#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:14,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {111752#(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; {111753#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:14,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {111753#(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; {111754#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:14,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {111754#(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; {111755#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:14,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {111755#(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; {111756#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:14,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {111756#(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; {111757#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:14,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {111757#(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; {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {111758#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {111825#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {111825#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 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; {111829#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:14,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {111829#(and (<= main_~y~0 10) (<= 10 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; {111833#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {111833#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 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; {111837#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:10:14,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {111837#(and (<= main_~y~0 10) (<= 10 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; {111841#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {111841#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {111845#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:10:14,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {111845#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ 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; {111849#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:14,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {111849#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 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; {111853#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:14,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {111853#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ 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; {111857#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:10:14,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {111857#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ 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; {111861#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} is VALID [2022-04-28 10:10:14,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {111861#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~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; {111865#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {111865#(and (<= main_~y~0 10) (<= 10 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; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {111744#false} assume !(~z~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {111744#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {111744#false} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-28 10:10:14,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-28 10:10:14,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-28 10:10:14,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-28 10:10:14,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-28 10:10:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:14,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:15,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {111744#false} assume !false; {111744#false} is VALID [2022-04-28 10:10:15,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {111744#false} assume 0 == ~cond; {111744#false} is VALID [2022-04-28 10:10:15,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {111744#false} ~cond := #in~cond; {111744#false} is VALID [2022-04-28 10:10:15,785 INFO L272 TraceCheckUtils]: 41: Hoare triple {111744#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {111744#false} is VALID [2022-04-28 10:10:15,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {111929#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {111744#false} is VALID [2022-04-28 10:10:15,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {111933#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111929#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:15,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {111937#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111933#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:15,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {111941#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111937#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:15,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {111945#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111941#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:15,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {111949#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111945#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {111953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111949#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {111957#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {111961#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111957#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:10:15,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {111965#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111961#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:15,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {111965#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:10:15,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~z~0 % 4294967296 > 0); {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-28 10:10:15,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {111976#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111969#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-28 10:10:15,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {111980#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111976#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {111984#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111980#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {111988#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111984#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {111992#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {111988#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {111996#(or (< 0 (mod (+ main_~y~0 4294967286) 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; {111992#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {112000#(or (< 0 (mod (+ main_~y~0 4294967286) 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; {111996#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:10:15,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {112004#(or (< 0 (mod (+ main_~y~0 4294967286) 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; {112000#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:10:15,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {112008#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112004#(or (< 0 (mod (+ main_~y~0 4294967286) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:10:15,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {112012#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112008#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {112016#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {112012#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {111743#true} ~z~0 := ~y~0; {112016#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {111743#true} assume !(~x~0 % 4294967296 > 0); {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {111743#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; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {111743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111743#true} is VALID [2022-04-28 10:10:15,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {111743#true} call #t~ret11 := main(); {111743#true} is VALID [2022-04-28 10:10:15,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111743#true} {111743#true} #61#return; {111743#true} is VALID [2022-04-28 10:10:15,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {111743#true} assume true; {111743#true} is VALID [2022-04-28 10:10:15,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {111743#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); {111743#true} is VALID [2022-04-28 10:10:15,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {111743#true} call ULTIMATE.init(); {111743#true} is VALID [2022-04-28 10:10:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:15,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155492895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:15,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:15,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 58 [2022-04-28 10:10:15,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927563919] [2022-04-28 10:10:15,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927563919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:15,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:15,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:10:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692986482] [2022-04-28 10:10:15,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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 45 [2022-04-28 10:10:15,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:15,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-28 10:10:15,827 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-28 10:10:15,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:10:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:10:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2808, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:10:15,827 INFO L87 Difference]: Start difference. First operand 199 states and 256 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-28 10:10:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:17,914 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-04-28 10:10:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:10:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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 45 [2022-04-28 10:10:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-28 10:10:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-04-28 10:10:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-28 10:10:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2022-04-28 10:10:17,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 49 transitions. [2022-04-28 10:10:17,950 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-28 10:10:17,952 INFO L225 Difference]: With dead ends: 215 [2022-04-28 10:10:17,952 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 10:10:17,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=960, Invalid=5360, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:10:17,953 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:17,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 126 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 10:10:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 10:10:18,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:18,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:18,600 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:18,600 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,602 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:10:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:10:18,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:18,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:18,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 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-28 10:10:18,602 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 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-28 10:10:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,603 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-28 10:10:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:10:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:18,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:18,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2022-04-28 10:10:18,606 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 45 [2022-04-28 10:10:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:18,606 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2022-04-28 10:10:18,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 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-28 10:10:18,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 241 transitions. [2022-04-28 10:10:19,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-28 10:10:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:19,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:19,166 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:19,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:19,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-04-28 10:10:19,366 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash 462891775, now seen corresponding path program 199 times [2022-04-28 10:10:19,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345820935] [2022-04-28 10:10:19,369 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:19,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 462891775, now seen corresponding path program 200 times [2022-04-28 10:10:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:19,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54291488] [2022-04-28 10:10:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:19,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {113318#(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); {113291#true} is VALID [2022-04-28 10:10:19,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-28 10:10:19,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-28 10:10:19,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:19,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {113318#(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); {113291#true} is VALID [2022-04-28 10:10:19,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-28 10:10:19,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-28 10:10:19,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-28 10:10:19,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113296#(= main_~y~0 0)} is VALID [2022-04-28 10:10:19,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {113296#(= 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; {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:19,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {113297#(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; {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:19,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {113298#(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; {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:19,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {113299#(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; {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:19,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {113300#(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; {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {113301#(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; {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:19,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {113302#(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; {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:19,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {113303#(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; {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {113304#(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; {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:19,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {113305#(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; {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:19,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {113306#(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; {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:19,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:19,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {113308#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:19,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {113308#(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; {113309#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:19,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {113309#(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; {113310#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:19,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {113310#(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; {113311#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:19,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {113311#(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; {113312#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:19,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {113312#(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; {113313#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:19,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {113313#(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; {113314#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:19,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {113314#(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; {113315#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:19,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {113315#(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; {113316#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:19,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {113316#(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; {113317#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {113317#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-28 10:10:19,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-28 10:10:19,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-28 10:10:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54291488] [2022-04-28 10:10:19,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54291488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950590693] [2022-04-28 10:10:19,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:19,745 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-04-28 10:10:19,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:19,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:19,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 10:10:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:19,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:20,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113291#true} is VALID [2022-04-28 10:10:20,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#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); {113291#true} is VALID [2022-04-28 10:10:20,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-28 10:10:20,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-28 10:10:20,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-28 10:10:20,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113296#(= main_~y~0 0)} is VALID [2022-04-28 10:10:20,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {113296#(= 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; {113297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:20,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {113297#(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; {113298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:20,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {113298#(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; {113299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:20,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {113299#(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; {113300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:20,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {113300#(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; {113301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:20,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {113301#(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; {113302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:20,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {113302#(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; {113303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:20,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {113303#(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; {113304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:20,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {113304#(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; {113305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:20,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {113305#(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; {113306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:20,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {113306#(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; {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {113307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {113376#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {113376#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 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; {113380#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:20,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {113380#(and (<= main_~y~0 11) (<= 11 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; {113384#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {113384#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 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; {113388#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {113388#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 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; {113392#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:10:20,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {113392#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {113396#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {113396#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 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; {113400#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {113400#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 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; {113404#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {113404#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 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; {113408#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {113408#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 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; {113412#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {113412#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-28 10:10:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:20,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:21,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {113292#false} assume !false; {113292#false} is VALID [2022-04-28 10:10:21,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {113292#false} assume 0 == ~cond; {113292#false} is VALID [2022-04-28 10:10:21,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {113292#false} ~cond := #in~cond; {113292#false} is VALID [2022-04-28 10:10:21,099 INFO L272 TraceCheckUtils]: 41: Hoare triple {113292#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {113292#false} is VALID [2022-04-28 10:10:21,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {113292#false} assume !(~y~0 % 4294967296 > 0); {113292#false} is VALID [2022-04-28 10:10:21,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {113292#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:21,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {113482#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113292#false} is VALID [2022-04-28 10:10:21,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {113486#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113482#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:21,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {113490#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113486#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:21,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {113494#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113490#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:21,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {113498#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113494#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:21,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {113502#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113498#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {113506#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113502#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {113510#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113506#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {113514#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113510#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:21,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {113518#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {113514#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:21,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {113522#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {113518#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:10:21,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {113526#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {113522#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:21,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {113530#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113526#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:21,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {113534#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {113530#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:21,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {113538#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113534#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:21,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {113542#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113538#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:21,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {113546#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113542#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:21,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {113550#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113546#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:21,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {113554#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113550#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:21,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {113558#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {113554#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {113291#true} ~z~0 := ~y~0; {113558#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {113291#true} assume !(~x~0 % 4294967296 > 0); {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {113291#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; {113291#true} is VALID [2022-04-28 10:10:21,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {113291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {113291#true} call #t~ret11 := main(); {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113291#true} {113291#true} #61#return; {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {113291#true} assume true; {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {113291#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); {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {113291#true} call ULTIMATE.init(); {113291#true} is VALID [2022-04-28 10:10:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-28 10:10:21,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950590693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:21,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:21,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 22] total 55 [2022-04-28 10:10:21,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:21,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345820935] [2022-04-28 10:10:21,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345820935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:21,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:21,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:10:21,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397866889] [2022-04-28 10:10:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:21,116 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 45 [2022-04-28 10:10:21,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:21,116 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-28 10:10:21,138 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-28 10:10:21,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:10:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:10:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2618, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:10:21,139 INFO L87 Difference]: Start difference. First operand 186 states and 241 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-28 10:10:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,792 INFO L93 Difference]: Finished difference Result 217 states and 272 transitions. [2022-04-28 10:10:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:10:23,793 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 45 [2022-04-28 10:10:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:23,793 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-28 10:10:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2022-04-28 10:10:23,793 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-28 10:10:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2022-04-28 10:10:23,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 63 transitions. [2022-04-28 10:10:23,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:23,846 INFO L225 Difference]: With dead ends: 217 [2022-04-28 10:10:23,846 INFO L226 Difference]: Without dead ends: 200 [2022-04-28 10:10:23,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=592, Invalid=5260, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 10:10:23,846 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:23,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-28 10:10:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-04-28 10:10:24,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:24,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,493 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,493 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,495 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-04-28 10:10:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2022-04-28 10:10:24,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 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 200 states. [2022-04-28 10:10:24,495 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 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 200 states. [2022-04-28 10:10:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,497 INFO L93 Difference]: Finished difference Result 200 states and 255 transitions. [2022-04-28 10:10:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2022-04-28 10:10:24,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:24,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 182 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-04-28 10:10:24,499 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 45 [2022-04-28 10:10:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:24,499 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-04-28 10:10:24,499 INFO L496 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-28 10:10:24,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 242 transitions. [2022-04-28 10:10:25,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-04-28 10:10:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:25,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:25,049 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:25,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-04-28 10:10:25,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-04-28 10:10:25,250 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 606825199, now seen corresponding path program 201 times [2022-04-28 10:10:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292599513] [2022-04-28 10:10:25,252 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:25,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 606825199, now seen corresponding path program 202 times [2022-04-28 10:10:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:25,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871900947] [2022-04-28 10:10:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {114896#(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); {114870#true} is VALID [2022-04-28 10:10:25,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-28 10:10:25,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-28 10:10:25,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:25,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {114896#(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); {114870#true} is VALID [2022-04-28 10:10:25,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-28 10:10:25,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-28 10:10:25,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-28 10:10:25,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114875#(= main_~y~0 0)} is VALID [2022-04-28 10:10:25,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {114875#(= 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; {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:25,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {114876#(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; {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:25,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#(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; {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:25,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {114878#(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; {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:25,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {114879#(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; {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:25,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {114880#(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; {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:25,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {114881#(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; {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:25,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {114882#(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; {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:25,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {114883#(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; {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:25,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {114884#(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; {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:25,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {114885#(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; {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:25,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {114886#(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; {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:25,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:25,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:25,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {114888#(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; {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:25,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {114889#(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; {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:25,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {114890#(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; {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:25,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {114891#(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; {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:25,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {114892#(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; {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:25,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {114893#(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; {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:25,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {114894#(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; {114895#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {114895#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:25,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:25,621 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-28 10:10:25,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-28 10:10:25,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-28 10:10:25,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-28 10:10:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:10:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871900947] [2022-04-28 10:10:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871900947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786382507] [2022-04-28 10:10:25,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:25,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:25,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:25,622 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:25,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-04-28 10:10:25,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:25,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:25,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:10:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:25,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:25,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114870#true} is VALID [2022-04-28 10:10:25,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#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); {114870#true} is VALID [2022-04-28 10:10:25,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-28 10:10:25,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-28 10:10:25,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-28 10:10:25,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {114875#(= main_~y~0 0)} is VALID [2022-04-28 10:10:25,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {114875#(= 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; {114876#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:25,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {114876#(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; {114877#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:25,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {114877#(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; {114878#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:25,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {114878#(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; {114879#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:25,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {114879#(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; {114880#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:25,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {114880#(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; {114881#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:25,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {114881#(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; {114882#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:25,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {114882#(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; {114883#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:25,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {114883#(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; {114884#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:25,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {114884#(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; {114885#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:25,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {114885#(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; {114886#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:25,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {114886#(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; {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:25,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:25,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {114887#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {114888#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:25,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {114888#(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; {114889#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:26,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {114889#(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; {114890#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:26,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {114890#(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; {114891#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:26,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {114891#(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; {114892#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:26,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {114892#(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; {114893#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:26,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {114893#(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; {114894#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:26,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {114894#(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; {114978#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {114978#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-28 10:10:26,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-28 10:10:26,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-28 10:10:26,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-28 10:10:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:10:26,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:26,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {114871#false} assume !false; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {114871#false} assume 0 == ~cond; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {114871#false} ~cond := #in~cond; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L272 TraceCheckUtils]: 41: Hoare triple {114871#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {114871#false} assume !(~y~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {114871#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {114871#false} is VALID [2022-04-28 10:10:26,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {115084#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {114871#false} is VALID [2022-04-28 10:10:26,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {115088#(< 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; {115084#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:26,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {115092#(< 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; {115088#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:26,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {115096#(< 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; {115092#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:26,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {115100#(< 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; {115096#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:26,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {115104#(< 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; {115100#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:26,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {115108#(< 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; {115104#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:26,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {115112#(< 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; {115108#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:26,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {115112#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:10:26,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:10:26,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {115123#(< 0 (mod (+ 4294967290 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; {115116#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:10:26,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {115127#(< 0 (mod (+ 4294967291 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; {115123#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:26,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {115131#(< 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; {115127#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:26,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {115135#(< 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; {115131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:26,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {115139#(< 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; {115135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:26,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {115143#(< 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; {115139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:26,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {115147#(< 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; {115143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:26,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {115151#(< 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; {115147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:26,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {115155#(< 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; {115151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:26,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {115159#(< 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; {115155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:26,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {115163#(< 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; {115159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:26,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {115167#(< 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; {115163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:26,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {114870#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115167#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:26,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {114870#true} call #t~ret11 := main(); {114870#true} is VALID [2022-04-28 10:10:26,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114870#true} {114870#true} #61#return; {114870#true} is VALID [2022-04-28 10:10:26,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {114870#true} assume true; {114870#true} is VALID [2022-04-28 10:10:26,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {114870#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); {114870#true} is VALID [2022-04-28 10:10:26,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {114870#true} call ULTIMATE.init(); {114870#true} is VALID [2022-04-28 10:10:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:10:26,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786382507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:26,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:26,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:10:26,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:26,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292599513] [2022-04-28 10:10:26,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292599513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:26,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:26,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:10:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187161527] [2022-04-28 10:10:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:26,735 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 45 [2022-04-28 10:10:26,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:26,735 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-28 10:10:26,757 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-28 10:10:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:10:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:10:26,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:10:26,758 INFO L87 Difference]: Start difference. First operand 187 states and 242 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-28 10:10:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:29,600 INFO L93 Difference]: Finished difference Result 220 states and 275 transitions. [2022-04-28 10:10:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:10:29,600 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 45 [2022-04-28 10:10:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:29,600 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-28 10:10:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-28 10:10:29,600 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-28 10:10:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 74 transitions. [2022-04-28 10:10:29,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 74 transitions. [2022-04-28 10:10:29,659 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-28 10:10:29,661 INFO L225 Difference]: With dead ends: 220 [2022-04-28 10:10:29,661 INFO L226 Difference]: Without dead ends: 202 [2022-04-28 10:10:29,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=958, Invalid=4444, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:10:29,661 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:29,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:10:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-28 10:10:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2022-04-28 10:10:30,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:30,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,361 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,361 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:30,363 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2022-04-28 10:10:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-04-28 10:10:30,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:30,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:30,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 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-28 10:10:30,364 INFO L87 Difference]: Start difference. First operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 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-28 10:10:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:30,366 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2022-04-28 10:10:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-04-28 10:10:30,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:30,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:30,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:30,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 183 states have internal predecessors, (239), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2022-04-28 10:10:30,368 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 45 [2022-04-28 10:10:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:30,368 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2022-04-28 10:10:30,368 INFO L496 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-28 10:10:30,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 243 transitions. [2022-04-28 10:10:30,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2022-04-28 10:10:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:30,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:30,915 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:30,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:31,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:31,119 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1175887039, now seen corresponding path program 203 times [2022-04-28 10:10:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134356677] [2022-04-28 10:10:31,123 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:31,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1175887039, now seen corresponding path program 204 times [2022-04-28 10:10:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190744090] [2022-04-28 10:10:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {116489#(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); {116464#true} is VALID [2022-04-28 10:10:31,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-28 10:10:31,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-28 10:10:31,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:31,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {116489#(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); {116464#true} is VALID [2022-04-28 10:10:31,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-28 10:10:31,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-28 10:10:31,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-28 10:10:31,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116469#(= main_~y~0 0)} is VALID [2022-04-28 10:10:31,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {116469#(= 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; {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:31,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {116470#(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; {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:31,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {116471#(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; {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:31,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {116472#(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; {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:31,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {116473#(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; {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:31,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {116474#(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; {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:31,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {116475#(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; {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:31,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {116476#(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; {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:31,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {116477#(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; {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:31,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {116478#(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; {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:31,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {116479#(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; {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:31,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {116480#(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; {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:31,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {116481#(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; {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:31,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:31,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:31,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {116483#(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; {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:31,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {116484#(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; {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:31,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {116485#(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; {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:31,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {116486#(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; {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {116487#(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; {116488#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {116488#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-28 10:10:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:10:31,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190744090] [2022-04-28 10:10:31,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190744090] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391398657] [2022-04-28 10:10:31,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:31,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:31,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:31,464 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:31,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-04-28 10:10:32,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:10:32,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:10:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:32,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:32,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116464#true} is VALID [2022-04-28 10:10:32,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#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); {116464#true} is VALID [2022-04-28 10:10:32,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-28 10:10:32,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-28 10:10:32,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-28 10:10:32,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116469#(= main_~y~0 0)} is VALID [2022-04-28 10:10:32,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {116469#(= 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; {116470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:32,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {116470#(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; {116471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:32,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {116471#(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; {116472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:32,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {116472#(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; {116473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:32,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {116473#(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; {116474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:32,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {116474#(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; {116475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:32,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {116475#(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; {116476#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:32,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {116476#(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; {116477#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:32,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {116477#(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; {116478#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:32,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {116478#(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; {116479#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:32,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {116479#(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; {116480#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:32,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {116480#(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; {116481#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:32,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {116481#(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; {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:32,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:32,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {116482#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {116483#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:32,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {116483#(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; {116484#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:32,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {116484#(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; {116485#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:32,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {116485#(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; {116486#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:32,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {116486#(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; {116487#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:32,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {116487#(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; {116568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {116568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-28 10:10:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:10:32,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {116465#false} assume !false; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {116465#false} assume 0 == ~cond; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {116465#false} ~cond := #in~cond; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L272 TraceCheckUtils]: 41: Hoare triple {116465#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {116465#false} assume !(~y~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {116465#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {116465#false} is VALID [2022-04-28 10:10:33,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {116680#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {116465#false} is VALID [2022-04-28 10:10:33,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {116684#(< 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; {116680#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:33,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {116688#(< 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; {116684#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:33,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {116692#(< 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; {116688#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:33,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {116696#(< 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; {116692#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:33,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {116700#(< 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; {116696#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:33,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {116700#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:33,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:33,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {116711#(< 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; {116704#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:33,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {116715#(< 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; {116711#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:33,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {116719#(< 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; {116715#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:33,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {116723#(< 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; {116719#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:33,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {116727#(< 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; {116723#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:33,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {116731#(< 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; {116727#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:33,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {116735#(< 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; {116731#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:33,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {116739#(< 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; {116735#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:33,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {116743#(< 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; {116739#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:33,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {116747#(< 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; {116743#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:33,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {116751#(< 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; {116747#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:33,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {116755#(< 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; {116751#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:33,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {116759#(< 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; {116755#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:33,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {116464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {116759#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:33,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {116464#true} call #t~ret11 := main(); {116464#true} is VALID [2022-04-28 10:10:33,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116464#true} {116464#true} #61#return; {116464#true} is VALID [2022-04-28 10:10:33,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {116464#true} assume true; {116464#true} is VALID [2022-04-28 10:10:33,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {116464#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); {116464#true} is VALID [2022-04-28 10:10:33,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {116464#true} call ULTIMATE.init(); {116464#true} is VALID [2022-04-28 10:10:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:10:33,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391398657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:33,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:10:33,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:33,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134356677] [2022-04-28 10:10:33,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134356677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:33,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:10:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233398874] [2022-04-28 10:10:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:33,069 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 45 [2022-04-28 10:10:33,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:33,069 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-28 10:10:33,091 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-28 10:10:33,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:10:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:33,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:10:33,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:10:33,092 INFO L87 Difference]: Start difference. First operand 188 states and 243 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-28 10:10:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:35,783 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2022-04-28 10:10:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:10:35,783 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 45 [2022-04-28 10:10:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:35,783 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-28 10:10:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-28 10:10:35,784 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-28 10:10:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-28 10:10:35,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2022-04-28 10:10:35,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:35,850 INFO L225 Difference]: With dead ends: 223 [2022-04-28 10:10:35,850 INFO L226 Difference]: Without dead ends: 204 [2022-04-28 10:10:35,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=983, Invalid=4273, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:10:35,850 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:35,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-28 10:10:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 189. [2022-04-28 10:10:36,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:36,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:10:36,513 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:10:36,514 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:10:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:36,516 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-04-28 10:10:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-04-28 10:10:36,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:36,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:36,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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 204 states. [2022-04-28 10:10:36,516 INFO L87 Difference]: Start difference. First operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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 204 states. [2022-04-28 10:10:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:36,518 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2022-04-28 10:10:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 259 transitions. [2022-04-28 10:10:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:36,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:36,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 184 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-28 10:10:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2022-04-28 10:10:36,520 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 244 transitions. Word has length 45 [2022-04-28 10:10:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:36,520 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 244 transitions. [2022-04-28 10:10:36,520 INFO L496 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-28 10:10:36,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 244 transitions. [2022-04-28 10:10:37,078 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-28 10:10:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 244 transitions. [2022-04-28 10:10:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:37,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:37,078 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:37,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-04-28 10:10:37,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:37,279 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -151209681, now seen corresponding path program 205 times [2022-04-28 10:10:37,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:37,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888794835] [2022-04-28 10:10:37,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:37,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash -151209681, now seen corresponding path program 206 times [2022-04-28 10:10:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:37,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112927933] [2022-04-28 10:10:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:37,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {118094#(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); {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:37,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {118094#(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); {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-28 10:10:37,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-28 10:10:37,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118075#(= main_~y~0 0)} is VALID [2022-04-28 10:10:37,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {118075#(= 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; {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:37,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {118076#(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; {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:37,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {118077#(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; {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:37,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {118078#(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; {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:37,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {118079#(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; {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:37,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {118080#(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; {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:37,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {118081#(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; {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:37,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {118082#(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; {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:37,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {118083#(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; {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:37,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {118084#(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; {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:37,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {118085#(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; {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:37,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {118086#(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; {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:37,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {118087#(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; {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:37,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {118088#(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; {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:37,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:37,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:10:37,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:37,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {118091#(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; {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {118092#(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; {118093#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {118093#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-28 10:10:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:10:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:37,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112927933] [2022-04-28 10:10:37,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112927933] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:37,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206334269] [2022-04-28 10:10:37,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:37,592 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:37,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-04-28 10:10:37,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:37,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:37,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:10:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:37,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:37,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118070#true} is VALID [2022-04-28 10:10:37,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#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); {118070#true} is VALID [2022-04-28 10:10:37,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-28 10:10:37,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-28 10:10:37,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-28 10:10:37,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118075#(= main_~y~0 0)} is VALID [2022-04-28 10:10:37,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {118075#(= 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; {118076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:37,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {118076#(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; {118077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:37,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {118077#(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; {118078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:37,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {118078#(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; {118079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:37,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {118079#(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; {118080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:37,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {118080#(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; {118081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:37,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {118081#(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; {118082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:37,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {118082#(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; {118083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:37,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {118083#(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; {118084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:37,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {118084#(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; {118085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:37,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {118085#(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; {118086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:37,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {118086#(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; {118087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:37,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {118087#(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; {118088#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:37,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {118088#(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; {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:37,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:37,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {118089#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:10:37,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {118090#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {118091#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:37,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {118091#(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; {118092#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:37,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {118092#(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; {118170#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {118170#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-28 10:10:37,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-28 10:10:37,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-28 10:10:37,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-28 10:10:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:10:37,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {118071#false} assume !false; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {118071#false} assume 0 == ~cond; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {118071#false} ~cond := #in~cond; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L272 TraceCheckUtils]: 41: Hoare triple {118071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {118071#false} assume !(~y~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {118071#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {118071#false} is VALID [2022-04-28 10:10:38,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {118288#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {118071#false} is VALID [2022-04-28 10:10:38,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {118292#(< 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; {118288#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:38,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {118296#(< 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; {118292#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:38,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {118300#(< 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; {118296#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:38,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {118300#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:38,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:38,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {118311#(< 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; {118304#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:38,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {118315#(< 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; {118311#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:38,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {118319#(< 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; {118315#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:38,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {118323#(< 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; {118319#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:38,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {118327#(< 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; {118323#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:38,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {118331#(< 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; {118327#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:38,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {118335#(< 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; {118331#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:38,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {118339#(< 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; {118335#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:38,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {118343#(< 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; {118339#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:38,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {118347#(< 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; {118343#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:38,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {118351#(< 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; {118347#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:38,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {118355#(< 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; {118351#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:38,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {118359#(< 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; {118355#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:38,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {118363#(< 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; {118359#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:38,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {118070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {118363#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:38,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {118070#true} call #t~ret11 := main(); {118070#true} is VALID [2022-04-28 10:10:38,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118070#true} {118070#true} #61#return; {118070#true} is VALID [2022-04-28 10:10:38,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {118070#true} assume true; {118070#true} is VALID [2022-04-28 10:10:38,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {118070#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); {118070#true} is VALID [2022-04-28 10:10:38,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {118070#true} call ULTIMATE.init(); {118070#true} is VALID [2022-04-28 10:10:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:10:38,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206334269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:38,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:38,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:10:38,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:38,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888794835] [2022-04-28 10:10:38,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888794835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:38,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:38,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:10:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906525960] [2022-04-28 10:10:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:38,593 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 45 [2022-04-28 10:10:38,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:38,593 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-28 10:10:38,613 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-28 10:10:38,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:10:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:10:38,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:10:38,614 INFO L87 Difference]: Start difference. First operand 189 states and 244 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-28 10:10:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:41,264 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2022-04-28 10:10:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:10:41,264 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 45 [2022-04-28 10:10:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:41,264 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-28 10:10:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2022-04-28 10:10:41,264 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-28 10:10:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2022-04-28 10:10:41,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 81 transitions. [2022-04-28 10:10:41,329 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-28 10:10:41,331 INFO L225 Difference]: With dead ends: 226 [2022-04-28 10:10:41,331 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 10:10:41,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:10:41,331 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:41,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 10:10:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2022-04-28 10:10:41,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:41,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,997 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,997 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:41,999 INFO L93 Difference]: Finished difference Result 206 states and 261 transitions. [2022-04-28 10:10:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2022-04-28 10:10:41,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:41,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:41,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 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 206 states. [2022-04-28 10:10:41,999 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 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 206 states. [2022-04-28 10:10:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:42,001 INFO L93 Difference]: Finished difference Result 206 states and 261 transitions. [2022-04-28 10:10:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2022-04-28 10:10:42,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:42,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:42,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:42,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 185 states have internal predecessors, (241), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:10:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2022-04-28 10:10:42,004 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 45 [2022-04-28 10:10:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:42,004 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2022-04-28 10:10:42,004 INFO L496 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-28 10:10:42,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 245 transitions. [2022-04-28 10:10:42,569 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-28 10:10:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2022-04-28 10:10:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:10:42,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:42,570 INFO L195 NwaCegarLoop]: trace histogram [28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:42,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-04-28 10:10:42,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-04-28 10:10:42,771 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash -362075825, now seen corresponding path program 207 times [2022-04-28 10:10:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842421160] [2022-04-28 10:10:42,773 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:42,773 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -362075825, now seen corresponding path program 208 times [2022-04-28 10:10:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271414538] [2022-04-28 10:10:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:43,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {119714#(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); {119678#true} is VALID [2022-04-28 10:10:43,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-28 10:10:43,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-28 10:10:43,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {119714#(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); {119678#true} is VALID [2022-04-28 10:10:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-28 10:10:43,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-28 10:10:43,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-28 10:10:43,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119683#(= main_~y~0 0)} is VALID [2022-04-28 10:10:43,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {119683#(= 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; {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:43,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {119684#(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; {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:43,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {119685#(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; {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:43,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {119686#(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; {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:43,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {119687#(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; {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:43,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {119688#(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; {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:43,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {119689#(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; {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:43,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {119690#(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; {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:43,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {119691#(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; {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:43,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {119692#(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; {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:43,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {119693#(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; {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:43,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {119694#(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; {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:43,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {119695#(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; {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:43,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {119696#(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; {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:43,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {119697#(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; {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:43,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {119698#(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; {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:43,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {119699#(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; {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:43,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {119700#(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; {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:43,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {119701#(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; {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:43,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {119702#(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; {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:43,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {119703#(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; {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:43,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {119704#(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; {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:43,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {119705#(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; {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:43,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {119706#(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; {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:10:43,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {119707#(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; {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:10:43,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {119708#(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; {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:10:43,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {119709#(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; {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:43,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#(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; {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:10:43,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:10:43,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-28 10:10:43,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119713#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {119713#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-28 10:10:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271414538] [2022-04-28 10:10:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271414538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584931574] [2022-04-28 10:10:43,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:43,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:43,401 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:43,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-04-28 10:10:43,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:43,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:43,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 10:10:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:43,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:43,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119678#true} is VALID [2022-04-28 10:10:43,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#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); {119678#true} is VALID [2022-04-28 10:10:43,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-28 10:10:43,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-28 10:10:43,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-28 10:10:43,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119683#(= main_~y~0 0)} is VALID [2022-04-28 10:10:43,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {119683#(= 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; {119684#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:43,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {119684#(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; {119685#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:43,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {119685#(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; {119686#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:43,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {119686#(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; {119687#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:43,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {119687#(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; {119688#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:43,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {119688#(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; {119689#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:43,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {119689#(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; {119690#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:43,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {119690#(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; {119691#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:43,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {119691#(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; {119692#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:43,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {119692#(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; {119693#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:43,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {119693#(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; {119694#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:43,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {119694#(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; {119695#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:43,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {119695#(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; {119696#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:43,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {119696#(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; {119697#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:43,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {119697#(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; {119698#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:43,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {119698#(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; {119699#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:43,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {119699#(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; {119700#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:43,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {119700#(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; {119701#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:43,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {119701#(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; {119702#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:43,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {119702#(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; {119703#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:43,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {119703#(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; {119704#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:43,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {119704#(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; {119705#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:43,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {119705#(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; {119706#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:43,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {119706#(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; {119707#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:10:43,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {119707#(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; {119708#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:10:43,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {119708#(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; {119709#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:10:43,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {119709#(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; {119710#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:10:43,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {119710#(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; {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:10:43,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:10:43,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {119711#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-28 10:10:43,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {119712#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119826#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:10:43,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {119826#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-28 10:10:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:43,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {119679#false} assume !false; {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {119679#false} assume 0 == ~cond; {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {119679#false} ~cond := #in~cond; {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L272 TraceCheckUtils]: 41: Hoare triple {119679#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {119679#false} assume !(~y~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {119679#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {119679#false} is VALID [2022-04-28 10:10:45,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {119872#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {119679#false} is VALID [2022-04-28 10:10:45,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {119876#(< 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; {119872#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:45,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {119876#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:45,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:45,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {119887#(< 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; {119880#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:45,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {119891#(< 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; {119887#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:45,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {119895#(< 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; {119891#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:45,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {119899#(< 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; {119895#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:45,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {119903#(< 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; {119899#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:45,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {119907#(< 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; {119903#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:45,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {119911#(< 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; {119907#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:45,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {119915#(< 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; {119911#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:45,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {119919#(< 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; {119915#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:45,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {119923#(< 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; {119919#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:45,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {119927#(< 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; {119923#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:45,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {119931#(< 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; {119927#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:45,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {119935#(< 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; {119931#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:45,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {119939#(< 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; {119935#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:45,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {119943#(< 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; {119939#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:45,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {119947#(< 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; {119943#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:45,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {119951#(< 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; {119947#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:45,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {119955#(< 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; {119951#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:45,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {119959#(< 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; {119955#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:10:45,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {119963#(< 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; {119959#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:10:45,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {119967#(< 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; {119963#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:45,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {119971#(< 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; {119967#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:10:45,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {119975#(< 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; {119971#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:10:45,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {119979#(< 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; {119975#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:10:45,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {119983#(< 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; {119979#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:45,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {119987#(< 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; {119983#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:10:45,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {119991#(< 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; {119987#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:10:45,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {119995#(< 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; {119991#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:10:45,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {119678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119995#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:10:45,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {119678#true} call #t~ret11 := main(); {119678#true} is VALID [2022-04-28 10:10:45,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119678#true} {119678#true} #61#return; {119678#true} is VALID [2022-04-28 10:10:45,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {119678#true} assume true; {119678#true} is VALID [2022-04-28 10:10:45,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {119678#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); {119678#true} is VALID [2022-04-28 10:10:45,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {119678#true} call ULTIMATE.init(); {119678#true} is VALID [2022-04-28 10:10:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:10:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584931574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:45,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 10:10:45,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:45,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842421160] [2022-04-28 10:10:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842421160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:45,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 10:10:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840624588] [2022-04-28 10:10:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:45,382 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 45 [2022-04-28 10:10:45,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:45,382 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-28 10:10:45,407 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-28 10:10:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 10:10:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 10:10:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=3314, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:10:45,408 INFO L87 Difference]: Start difference. First operand 190 states and 245 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-28 10:10:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:52,279 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2022-04-28 10:10:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:10:52,279 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 45 [2022-04-28 10:10:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:52,279 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-28 10:10:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 186 transitions. [2022-04-28 10:10:52,281 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-28 10:10:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 186 transitions. [2022-04-28 10:10:52,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 186 transitions. [2022-04-28 10:10:52,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:52,433 INFO L225 Difference]: With dead ends: 305 [2022-04-28 10:10:52,433 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 10:10:52,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2044, Invalid=7462, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 10:10:52,434 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 155 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4000 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 4123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:52,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 214 Invalid, 4123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4000 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 10:10:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 10:10:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 196. [2022-04-28 10:10:53,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:53,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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-28 10:10:53,122 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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-28 10:10:53,122 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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-28 10:10:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,125 INFO L93 Difference]: Finished difference Result 297 states and 363 transitions. [2022-04-28 10:10:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2022-04-28 10:10:53,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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 297 states. [2022-04-28 10:10:53,125 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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 297 states. [2022-04-28 10:10:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,128 INFO L93 Difference]: Finished difference Result 297 states and 363 transitions. [2022-04-28 10:10:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 363 transitions. [2022-04-28 10:10:53,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:53,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 191 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-28 10:10:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2022-04-28 10:10:53,131 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 45 [2022-04-28 10:10:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:53,131 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2022-04-28 10:10:53,131 INFO L496 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-28 10:10:53,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 253 transitions. [2022-04-28 10:10:53,692 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-28 10:10:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2022-04-28 10:10:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:10:53,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:53,692 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:53,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:53,893 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -908063361, now seen corresponding path program 209 times [2022-04-28 10:10:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:53,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146286188] [2022-04-28 10:10:53,895 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:53,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash -908063361, now seen corresponding path program 210 times [2022-04-28 10:10:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:53,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129449456] [2022-04-28 10:10:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:54,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {121704#(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); {121676#true} is VALID [2022-04-28 10:10:54,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-28 10:10:54,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-28 10:10:54,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:54,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {121704#(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); {121676#true} is VALID [2022-04-28 10:10:54,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-28 10:10:54,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-28 10:10:54,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-28 10:10:54,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121681#(= main_~y~0 0)} is VALID [2022-04-28 10:10:54,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {121681#(= 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; {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:54,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {121682#(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; {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:54,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {121683#(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; {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:54,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {121684#(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; {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:54,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {121685#(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; {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:54,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {121686#(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; {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:54,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {121687#(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; {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:54,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {121688#(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; {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:54,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {121689#(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; {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:54,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {121690#(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; {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:54,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {121691#(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; {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:54,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:54,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {121693#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:54,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {121693#(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; {121694#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:54,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {121694#(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; {121695#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:54,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {121695#(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; {121696#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:54,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {121696#(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; {121697#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:54,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {121697#(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; {121698#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:54,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {121698#(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; {121699#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:54,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {121699#(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; {121700#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:54,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {121700#(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; {121701#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:54,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {121701#(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; {121702#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:54,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {121702#(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; {121703#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:54,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {121703#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-28 10:10:54,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-28 10:10:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:54,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129449456] [2022-04-28 10:10:54,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129449456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068565514] [2022-04-28 10:10:54,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:54,304 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-04-28 10:10:54,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:10:54,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:54,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 10:10:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:54,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:55,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121676#true} is VALID [2022-04-28 10:10:55,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#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); {121676#true} is VALID [2022-04-28 10:10:55,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-28 10:10:55,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-28 10:10:55,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-28 10:10:55,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121681#(= main_~y~0 0)} is VALID [2022-04-28 10:10:55,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {121681#(= 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; {121682#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:55,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {121682#(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; {121683#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:55,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {121683#(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; {121684#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:55,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {121684#(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; {121685#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:55,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {121685#(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; {121686#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:55,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {121686#(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; {121687#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {121687#(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; {121688#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:55,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {121688#(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; {121689#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:55,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {121689#(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; {121690#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:55,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {121690#(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; {121691#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:55,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {121691#(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; {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {121692#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {121762#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {121762#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 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; {121766#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:55,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {121766#(and (<= main_~y~0 11) (<= 11 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; {121770#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {121770#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 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; {121774#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {121774#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 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; {121778#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {121778#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 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; {121782#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {121782#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 11 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; {121786#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {121786#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 11 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; {121790#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {121790#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)) (<= 11 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; {121794#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ 5 main_~z~0)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {121794#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ 5 main_~z~0)) (<= 11 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; {121798#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 6)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:55,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {121798#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 6)) (<= 11 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; {121802#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {121802#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {121677#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-28 10:10:55,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-28 10:10:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:55,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:56,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {121677#false} assume !false; {121677#false} is VALID [2022-04-28 10:10:56,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {121677#false} assume 0 == ~cond; {121677#false} is VALID [2022-04-28 10:10:56,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {121677#false} ~cond := #in~cond; {121677#false} is VALID [2022-04-28 10:10:56,170 INFO L272 TraceCheckUtils]: 42: Hoare triple {121677#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {121677#false} is VALID [2022-04-28 10:10:56,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {121677#false} assume !(~y~0 % 4294967296 > 0); {121677#false} is VALID [2022-04-28 10:10:56,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {121869#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121677#false} is VALID [2022-04-28 10:10:56,172 INFO L290 TraceCheckUtils]: 39: Hoare triple {121873#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121869#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:56,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {121877#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121873#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:56,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {121881#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121877#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:56,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {121885#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121881#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:56,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {121889#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121885#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:56,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {121893#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121889#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:56,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {121897#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121893#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:56,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {121901#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121897#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:56,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {121905#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121901#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:56,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {121909#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {121905#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:10:56,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {121913#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {121909#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:56,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {121917#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {121913#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:10:56,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {121921#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121917#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:56,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {121925#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {121921#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:10:56,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {121929#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121925#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:56,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {121933#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121929#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:10:56,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {121937#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {121933#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:10:56,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {121941#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {121937#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:56,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {121945#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {121941#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:56,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {121949#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {121945#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:56,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {121953#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {121949#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:10:56,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {121676#true} ~z~0 := ~y~0; {121953#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:10:56,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {121676#true} assume !(~x~0 % 4294967296 > 0); {121676#true} is VALID [2022-04-28 10:10:56,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {121676#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; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {121676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {121676#true} call #t~ret11 := main(); {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121676#true} {121676#true} #61#return; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {121676#true} assume true; {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {121676#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); {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {121676#true} call ULTIMATE.init(); {121676#true} is VALID [2022-04-28 10:10:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:56,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068565514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:56,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:56,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 59 [2022-04-28 10:10:56,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:56,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146286188] [2022-04-28 10:10:56,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146286188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:56,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:56,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:10:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035542565] [2022-04-28 10:10:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:56,188 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 46 [2022-04-28 10:10:56,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:56,188 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-28 10:10:56,212 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-28 10:10:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:10:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:10:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3019, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 10:10:56,213 INFO L87 Difference]: Start difference. First operand 196 states and 253 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-28 10:10:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:58,964 INFO L93 Difference]: Finished difference Result 227 states and 284 transitions. [2022-04-28 10:10:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:10:58,964 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 46 [2022-04-28 10:10:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:58,964 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-28 10:10:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-28 10:10:58,964 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-28 10:10:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-04-28 10:10:58,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 64 transitions. [2022-04-28 10:10:59,015 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-28 10:10:59,017 INFO L225 Difference]: With dead ends: 227 [2022-04-28 10:10:59,017 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 10:10:59,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=671, Invalid=5971, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:10:59,018 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:59,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 123 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:10:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 10:10:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2022-04-28 10:10:59,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:59,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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-28 10:10:59,721 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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-28 10:10:59,721 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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-28 10:10:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,723 INFO L93 Difference]: Finished difference Result 210 states and 267 transitions. [2022-04-28 10:10:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2022-04-28 10:10:59,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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 210 states. [2022-04-28 10:10:59,723 INFO L87 Difference]: Start difference. First operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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 210 states. [2022-04-28 10:10:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,725 INFO L93 Difference]: Finished difference Result 210 states and 267 transitions. [2022-04-28 10:10:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2022-04-28 10:10:59,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:59,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:59,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:59,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 192 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-28 10:10:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2022-04-28 10:10:59,728 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 46 [2022-04-28 10:10:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:59,728 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2022-04-28 10:10:59,728 INFO L496 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-28 10:10:59,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 254 transitions. [2022-04-28 10:11:00,327 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-28 10:11:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2022-04-28 10:11:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:11:00,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:00,328 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:00,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:00,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,529 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:00,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 54302029, now seen corresponding path program 211 times [2022-04-28 10:11:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:00,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039771872] [2022-04-28 10:11:00,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:00,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash 54302029, now seen corresponding path program 212 times [2022-04-28 10:11:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278985757] [2022-04-28 10:11:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {123354#(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); {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:00,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {123354#(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); {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-28 10:11:00,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123332#(= main_~y~0 0)} is VALID [2022-04-28 10:11:00,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {123332#(= 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; {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:00,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {123333#(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; {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:00,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {123334#(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; {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:00,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {123335#(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; {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:00,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {123336#(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; {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:00,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {123337#(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; {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:00,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {123338#(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; {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:00,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {123339#(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; {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:00,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {123340#(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; {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:00,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {123341#(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; {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:00,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {123342#(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; {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:00,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {123343#(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; {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:00,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:00,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:00,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {123345#(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; {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:00,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {123346#(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; {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:00,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {123347#(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; {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:00,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {123348#(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; {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:00,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {123349#(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; {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:00,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {123350#(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; {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:00,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {123351#(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; {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:00,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {123352#(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; {123353#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:00,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {123353#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:00,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-28 10:11:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:11:00,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278985757] [2022-04-28 10:11:00,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278985757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045945529] [2022-04-28 10:11:00,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:00,927 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:00,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-04-28 10:11:00,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:00,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:00,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:00,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:01,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123327#true} is VALID [2022-04-28 10:11:01,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#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); {123327#true} is VALID [2022-04-28 10:11:01,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-28 10:11:01,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-28 10:11:01,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-28 10:11:01,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123332#(= main_~y~0 0)} is VALID [2022-04-28 10:11:01,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {123332#(= 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; {123333#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:01,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {123333#(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; {123334#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:01,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {123334#(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; {123335#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:01,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {123335#(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; {123336#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:01,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {123336#(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; {123337#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:01,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {123337#(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; {123338#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:01,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {123338#(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; {123339#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:01,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {123339#(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; {123340#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:01,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {123340#(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; {123341#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:01,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {123341#(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; {123342#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:01,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {123342#(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; {123343#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:01,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {123343#(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; {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:01,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:01,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {123344#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {123345#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:01,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {123345#(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; {123346#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {123346#(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; {123347#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:01,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {123347#(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; {123348#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:01,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {123348#(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; {123349#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:01,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {123349#(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; {123350#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {123350#(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; {123351#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:01,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {123351#(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; {123352#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {123352#(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; {123439#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {123439#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-28 10:11:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:11:01,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {123328#false} assume !false; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {123328#false} assume 0 == ~cond; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {123328#false} ~cond := #in~cond; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L272 TraceCheckUtils]: 42: Hoare triple {123328#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {123328#false} assume !(~y~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {123328#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {123328#false} is VALID [2022-04-28 10:11:02,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {123545#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {123328#false} is VALID [2022-04-28 10:11:02,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {123549#(< 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; {123545#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:02,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {123553#(< 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; {123549#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:02,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {123557#(< 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; {123553#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:02,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {123561#(< 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; {123557#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:02,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {123565#(< 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; {123561#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:02,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {123569#(< 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; {123565#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:02,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {123573#(< 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; {123569#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:02,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {123577#(< 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; {123573#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:02,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {123577#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:02,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {123588#(< 0 (mod (+ main_~y~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; {123581#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {123592#(< 0 (mod (+ 4294967290 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; {123588#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:02,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {123596#(< 0 (mod (+ 4294967291 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; {123592#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {123600#(< 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; {123596#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {123604#(< 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; {123600#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:02,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {123608#(< 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; {123604#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:02,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {123612#(< 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; {123608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:02,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {123616#(< 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; {123612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:02,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {123620#(< 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; {123616#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:02,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {123624#(< 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; {123620#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:02,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {123628#(< 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; {123624#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:02,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {123632#(< 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; {123628#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:02,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {123327#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {123632#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:02,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {123327#true} call #t~ret11 := main(); {123327#true} is VALID [2022-04-28 10:11:02,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123327#true} {123327#true} #61#return; {123327#true} is VALID [2022-04-28 10:11:02,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {123327#true} assume true; {123327#true} is VALID [2022-04-28 10:11:02,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {123327#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); {123327#true} is VALID [2022-04-28 10:11:02,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {123327#true} call ULTIMATE.init(); {123327#true} is VALID [2022-04-28 10:11:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:11:02,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045945529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:02,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:02,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:11:02,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:02,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039771872] [2022-04-28 10:11:02,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039771872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:02,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:02,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285765646] [2022-04-28 10:11:02,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:02,086 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 46 [2022-04-28 10:11:02,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:02,086 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-28 10:11:02,109 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-28 10:11:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:02,109 INFO L87 Difference]: Start difference. First operand 197 states and 254 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-28 10:11:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:04,800 INFO L93 Difference]: Finished difference Result 230 states and 287 transitions. [2022-04-28 10:11:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:11:04,800 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 46 [2022-04-28 10:11:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:04,800 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-28 10:11:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 76 transitions. [2022-04-28 10:11:04,800 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-28 10:11:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 76 transitions. [2022-04-28 10:11:04,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 76 transitions. [2022-04-28 10:11:04,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:04,863 INFO L225 Difference]: With dead ends: 230 [2022-04-28 10:11:04,863 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 10:11:04,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1042, Invalid=4964, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:11:04,863 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:04,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:11:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 10:11:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2022-04-28 10:11:05,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:05,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:05,575 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:05,575 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:05,577 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2022-04-28 10:11:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2022-04-28 10:11:05,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:05,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:05,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 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-28 10:11:05,577 INFO L87 Difference]: Start difference. First operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 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-28 10:11:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:05,579 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2022-04-28 10:11:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 269 transitions. [2022-04-28 10:11:05,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:05,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:05,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:05,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 193 states have internal predecessors, (251), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2022-04-28 10:11:05,582 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 46 [2022-04-28 10:11:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:05,582 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2022-04-28 10:11:05,582 INFO L496 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-28 10:11:05,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 255 transitions. [2022-04-28 10:11:06,219 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-28 10:11:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2022-04-28 10:11:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:11:06,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:06,220 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:06,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:06,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:06,420 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash -597161089, now seen corresponding path program 213 times [2022-04-28 10:11:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904793372] [2022-04-28 10:11:06,423 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:06,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -597161089, now seen corresponding path program 214 times [2022-04-28 10:11:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:06,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355230665] [2022-04-28 10:11:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {125019#(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); {124993#true} is VALID [2022-04-28 10:11:06,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-28 10:11:06,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-28 10:11:06,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {125019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:06,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {125019#(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); {124993#true} is VALID [2022-04-28 10:11:06,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-28 10:11:06,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-28 10:11:06,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-28 10:11:06,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {124998#(= main_~y~0 0)} is VALID [2022-04-28 10:11:06,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {124998#(= 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; {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:06,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {124999#(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; {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:06,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {125000#(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; {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:06,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {125001#(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; {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:06,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {125002#(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; {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:06,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {125003#(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; {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:06,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {125004#(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; {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:06,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {125005#(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; {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:06,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {125006#(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; {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:06,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {125007#(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; {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:06,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {125008#(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; {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:06,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {125009#(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; {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:06,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {125010#(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; {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:06,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:06,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:06,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {125012#(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; {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:06,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {125013#(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; {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:06,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {125014#(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; {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:06,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {125015#(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; {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:06,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {125016#(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; {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:06,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {125017#(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; {125018#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:06,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {125018#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-28 10:11:06,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-28 10:11:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355230665] [2022-04-28 10:11:06,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355230665] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:06,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299590655] [2022-04-28 10:11:06,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:06,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:06,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:06,789 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:06,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-04-28 10:11:06,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:06,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:06,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:11:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:06,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:07,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {124993#true} is VALID [2022-04-28 10:11:07,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#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); {124993#true} is VALID [2022-04-28 10:11:07,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-28 10:11:07,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-28 10:11:07,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-28 10:11:07,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {124998#(= main_~y~0 0)} is VALID [2022-04-28 10:11:07,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {124998#(= 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; {124999#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:07,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {124999#(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; {125000#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:07,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {125000#(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; {125001#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:07,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {125001#(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; {125002#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:07,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {125002#(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; {125003#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:07,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {125003#(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; {125004#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:07,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {125004#(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; {125005#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:07,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {125005#(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; {125006#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:07,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {125006#(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; {125007#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:07,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {125007#(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; {125008#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:07,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {125008#(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; {125009#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:07,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {125009#(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; {125010#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:07,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {125010#(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; {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:07,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:07,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {125011#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {125012#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:07,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {125012#(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; {125013#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:07,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {125013#(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; {125014#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:07,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {125014#(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; {125015#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:07,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {125015#(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; {125016#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:07,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {125016#(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; {125017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:07,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {125017#(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; {125101#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {125101#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:07,208 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-28 10:11:07,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-28 10:11:07,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-28 10:11:07,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-28 10:11:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:07,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {124994#false} assume !false; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {124994#false} assume 0 == ~cond; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {124994#false} ~cond := #in~cond; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L272 TraceCheckUtils]: 42: Hoare triple {124994#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {124994#false} assume !(~y~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {124994#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {124994#false} is VALID [2022-04-28 10:11:07,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {125213#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {124994#false} is VALID [2022-04-28 10:11:07,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {125217#(< 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; {125213#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:07,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {125221#(< 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; {125217#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:07,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {125225#(< 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; {125221#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:07,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {125229#(< 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; {125225#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:07,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {125233#(< 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; {125229#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:07,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {125237#(< 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; {125233#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:07,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {125237#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:07,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {125248#(< 0 (mod (+ 4294967291 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; {125241#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {125252#(< 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; {125248#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {125256#(< 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; {125252#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {125260#(< 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; {125256#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:07,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {125264#(< 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; {125260#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:07,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {125268#(< 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; {125264#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:07,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {125272#(< 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; {125268#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:07,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {125276#(< 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; {125272#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:07,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {125280#(< 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; {125276#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:07,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {125284#(< 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; {125280#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:07,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {125288#(< 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; {125284#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:07,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {125292#(< 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; {125288#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {125296#(< 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; {125292#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:07,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {124993#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125296#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:07,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {124993#true} call #t~ret11 := main(); {124993#true} is VALID [2022-04-28 10:11:07,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124993#true} {124993#true} #61#return; {124993#true} is VALID [2022-04-28 10:11:07,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {124993#true} assume true; {124993#true} is VALID [2022-04-28 10:11:07,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {124993#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); {124993#true} is VALID [2022-04-28 10:11:07,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {124993#true} call ULTIMATE.init(); {124993#true} is VALID [2022-04-28 10:11:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:07,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299590655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:07,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:07,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:11:07,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:07,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904793372] [2022-04-28 10:11:07,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904793372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:07,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:07,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:11:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466769891] [2022-04-28 10:11:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:07,925 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 46 [2022-04-28 10:11:07,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:07,925 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-28 10:11:07,952 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-28 10:11:07,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:11:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:11:07,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:11:07,953 INFO L87 Difference]: Start difference. First operand 198 states and 255 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-28 10:11:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:10,831 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2022-04-28 10:11:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:11:10,831 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 46 [2022-04-28 10:11:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:10,832 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-28 10:11:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-28 10:11:10,832 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-28 10:11:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-28 10:11:10,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 83 transitions. [2022-04-28 10:11:10,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:10,899 INFO L225 Difference]: With dead ends: 233 [2022-04-28 10:11:10,899 INFO L226 Difference]: Without dead ends: 214 [2022-04-28 10:11:10,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1102, Invalid=4904, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:11:10,900 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:10,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:11:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-28 10:11:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 199. [2022-04-28 10:11:11,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:11,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,615 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,615 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,617 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2022-04-28 10:11:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 271 transitions. [2022-04-28 10:11:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:11,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 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 214 states. [2022-04-28 10:11:11,618 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 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 214 states. [2022-04-28 10:11:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:11,621 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2022-04-28 10:11:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 271 transitions. [2022-04-28 10:11:11,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:11,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:11,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:11,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.2989690721649485) internal successors, (252), 194 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 256 transitions. [2022-04-28 10:11:11,625 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 256 transitions. Word has length 46 [2022-04-28 10:11:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:11,625 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 256 transitions. [2022-04-28 10:11:11,625 INFO L496 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-28 10:11:11,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 256 transitions. [2022-04-28 10:11:12,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 256 transitions. [2022-04-28 10:11:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:11:12,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:12,222 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:12,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-04-28 10:11:12,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-04-28 10:11:12,423 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1084411725, now seen corresponding path program 215 times [2022-04-28 10:11:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:12,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740945636] [2022-04-28 10:11:12,425 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:12,425 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1084411725, now seen corresponding path program 216 times [2022-04-28 10:11:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:12,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111648590] [2022-04-28 10:11:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:12,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {126698#(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); {126673#true} is VALID [2022-04-28 10:11:12,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-28 10:11:12,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-28 10:11:12,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:12,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {126698#(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); {126673#true} is VALID [2022-04-28 10:11:12,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-28 10:11:12,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-28 10:11:12,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-28 10:11:12,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126678#(= main_~y~0 0)} is VALID [2022-04-28 10:11:12,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {126678#(= 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; {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:12,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {126679#(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; {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:12,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {126680#(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; {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:12,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {126681#(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; {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:12,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {126682#(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; {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:12,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {126683#(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; {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:12,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {126684#(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; {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:12,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {126685#(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; {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:12,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {126686#(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; {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:12,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {126687#(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; {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:12,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {126688#(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; {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:12,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {126689#(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; {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:12,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {126690#(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; {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:12,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {126691#(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; {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:12,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:12,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:12,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:12,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {126694#(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; {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:12,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {126695#(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; {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:12,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {126696#(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; {126697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {126697#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-28 10:11:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:11:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:12,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111648590] [2022-04-28 10:11:12,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111648590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:12,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527530308] [2022-04-28 10:11:12,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:12,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:12,775 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:12,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-04-28 10:11:13,383 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:11:13,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:13,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:11:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:13,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:13,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126673#true} is VALID [2022-04-28 10:11:13,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#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); {126673#true} is VALID [2022-04-28 10:11:13,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-28 10:11:13,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-28 10:11:13,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-28 10:11:13,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126678#(= main_~y~0 0)} is VALID [2022-04-28 10:11:13,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {126678#(= 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; {126679#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:13,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {126679#(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; {126680#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:13,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {126680#(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; {126681#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:13,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {126681#(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; {126682#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:13,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {126682#(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; {126683#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:13,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {126683#(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; {126684#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:13,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {126684#(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; {126685#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:13,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {126685#(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; {126686#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:13,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {126686#(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; {126687#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:13,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {126687#(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; {126688#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:13,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {126688#(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; {126689#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:13,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {126689#(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; {126690#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:13,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {126690#(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; {126691#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:13,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {126691#(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; {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:13,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:13,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {126692#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:13,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {126693#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {126694#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:13,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {126694#(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; {126695#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:13,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {126695#(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; {126696#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:13,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {126696#(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; {126777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:13,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {126777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-28 10:11:13,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-28 10:11:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:11:13,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {126674#false} assume !false; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {126674#false} assume 0 == ~cond; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {126674#false} ~cond := #in~cond; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L272 TraceCheckUtils]: 42: Hoare triple {126674#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {126674#false} assume !(~y~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {126674#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {126674#false} is VALID [2022-04-28 10:11:14,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {126895#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {126674#false} is VALID [2022-04-28 10:11:14,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {126899#(< 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; {126895#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:14,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {126903#(< 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; {126899#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:14,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {126907#(< 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; {126903#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:14,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {126911#(< 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; {126907#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:14,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {126911#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:14,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:14,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {126922#(< 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; {126915#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:14,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {126926#(< 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; {126922#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:14,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {126930#(< 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; {126926#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:14,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {126934#(< 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; {126930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:14,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {126938#(< 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; {126934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:14,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {126942#(< 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; {126938#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:14,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {126946#(< 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; {126942#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:14,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {126950#(< 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; {126946#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:14,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {126954#(< 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; {126950#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:14,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {126958#(< 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; {126954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:14,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {126962#(< 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; {126958#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:14,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {126966#(< 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; {126962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:14,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {126970#(< 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; {126966#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:14,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {126974#(< 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; {126970#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:14,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {126673#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {126974#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:14,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {126673#true} call #t~ret11 := main(); {126673#true} is VALID [2022-04-28 10:11:14,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126673#true} {126673#true} #61#return; {126673#true} is VALID [2022-04-28 10:11:14,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {126673#true} assume true; {126673#true} is VALID [2022-04-28 10:11:14,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {126673#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); {126673#true} is VALID [2022-04-28 10:11:14,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {126673#true} call ULTIMATE.init(); {126673#true} is VALID [2022-04-28 10:11:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:11:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527530308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:14,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:14,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:11:14,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740945636] [2022-04-28 10:11:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740945636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:14,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:14,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:11:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775239792] [2022-04-28 10:11:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:14,386 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 46 [2022-04-28 10:11:14,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:14,386 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-28 10:11:14,407 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-28 10:11:14,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:11:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:11:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:14,408 INFO L87 Difference]: Start difference. First operand 199 states and 256 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-28 10:11:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:17,449 INFO L93 Difference]: Finished difference Result 236 states and 293 transitions. [2022-04-28 10:11:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:11:17,449 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 46 [2022-04-28 10:11:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:17,450 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-28 10:11:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-28 10:11:17,450 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-28 10:11:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-28 10:11:17,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 85 transitions. [2022-04-28 10:11:17,518 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-28 10:11:17,520 INFO L225 Difference]: With dead ends: 236 [2022-04-28 10:11:17,520 INFO L226 Difference]: Without dead ends: 216 [2022-04-28 10:11:17,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1004, Invalid=4252, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:11:17,521 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:17,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 124 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:11:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-28 10:11:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 200. [2022-04-28 10:11:18,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:18,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,247 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,248 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,250 INFO L93 Difference]: Finished difference Result 216 states and 273 transitions. [2022-04-28 10:11:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2022-04-28 10:11:18,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 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 216 states. [2022-04-28 10:11:18,250 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 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 216 states. [2022-04-28 10:11:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,252 INFO L93 Difference]: Finished difference Result 216 states and 273 transitions. [2022-04-28 10:11:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2022-04-28 10:11:18,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:18,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:18,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 195 states have internal predecessors, (253), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2022-04-28 10:11:18,254 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 46 [2022-04-28 10:11:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:18,255 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2022-04-28 10:11:18,255 INFO L496 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-28 10:11:18,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 257 transitions. [2022-04-28 10:11:18,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2022-04-28 10:11:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:11:18,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:18,863 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:18,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:19,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-04-28 10:11:19,067 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash -114583169, now seen corresponding path program 217 times [2022-04-28 10:11:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714831547] [2022-04-28 10:11:19,069 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:19,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash -114583169, now seen corresponding path program 218 times [2022-04-28 10:11:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:19,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218209737] [2022-04-28 10:11:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:19,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {128381#(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); {128357#true} is VALID [2022-04-28 10:11:19,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-28 10:11:19,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-28 10:11:19,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:19,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {128381#(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); {128357#true} is VALID [2022-04-28 10:11:19,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-28 10:11:19,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-28 10:11:19,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-28 10:11:19,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128362#(= main_~y~0 0)} is VALID [2022-04-28 10:11:19,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {128362#(= 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; {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:19,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {128363#(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; {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:19,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {128364#(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; {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:19,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {128365#(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; {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:19,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {128366#(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; {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:19,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {128367#(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; {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:19,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {128368#(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; {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:19,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {128369#(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; {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:19,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {128370#(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; {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:19,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {128371#(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; {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:19,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {128372#(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; {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:19,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {128373#(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; {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:19,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {128374#(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; {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:19,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {128375#(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; {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:19,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {128376#(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; {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:19,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:19,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:19,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {128378#(and (<= main_~z~0 15) (<= 15 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; {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:19,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128380#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:19,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {128380#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-28 10:11:19,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-28 10:11:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:11:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:19,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218209737] [2022-04-28 10:11:19,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218209737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:19,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410929208] [2022-04-28 10:11:19,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:19,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:19,404 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:19,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-04-28 10:11:19,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:19,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:11:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:19,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:19,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128357#true} is VALID [2022-04-28 10:11:19,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#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); {128357#true} is VALID [2022-04-28 10:11:19,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-28 10:11:19,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-28 10:11:19,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-28 10:11:19,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128362#(= main_~y~0 0)} is VALID [2022-04-28 10:11:19,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {128362#(= 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; {128363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:19,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {128363#(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; {128364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:19,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {128364#(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; {128365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:19,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {128365#(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; {128366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:19,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {128366#(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; {128367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:19,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {128367#(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; {128368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:19,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {128368#(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; {128369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:19,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {128369#(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; {128370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:19,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {128370#(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; {128371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:19,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {128371#(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; {128372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:19,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {128372#(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; {128373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:19,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {128373#(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; {128374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:19,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {128374#(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; {128375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:19,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {128375#(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; {128376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:19,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {128376#(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; {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:19,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:19,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {128377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {128378#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:19,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {128378#(and (<= main_~z~0 15) (<= 15 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; {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:19,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {128379#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {128457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-28 10:11:19,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-28 10:11:19,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-28 10:11:19,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-28 10:11:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:11:19,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:20,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {128358#false} assume !false; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {128358#false} assume 0 == ~cond; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {128358#false} ~cond := #in~cond; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L272 TraceCheckUtils]: 42: Hoare triple {128358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {128358#false} assume !(~y~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {128358#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {128358#false} is VALID [2022-04-28 10:11:20,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {128581#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {128358#false} is VALID [2022-04-28 10:11:20,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {128585#(< 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; {128581#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:20,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {128589#(< 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; {128585#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:20,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {128589#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:20,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:20,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {128600#(< 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; {128593#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:20,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {128604#(< 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; {128600#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:20,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {128608#(< 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; {128604#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:20,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {128612#(< 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; {128608#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:20,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {128616#(< 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; {128612#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:20,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {128620#(< 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; {128616#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:20,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {128624#(< 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; {128620#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:20,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {128628#(< 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; {128624#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:20,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {128632#(< 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; {128628#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:20,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {128636#(< 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; {128632#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:20,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {128640#(< 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; {128636#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:20,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {128644#(< 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; {128640#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:20,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {128648#(< 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; {128644#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:20,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {128652#(< 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; {128648#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:20,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {128656#(< 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; {128652#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:20,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {128357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128656#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:20,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {128357#true} call #t~ret11 := main(); {128357#true} is VALID [2022-04-28 10:11:20,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128357#true} {128357#true} #61#return; {128357#true} is VALID [2022-04-28 10:11:20,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {128357#true} assume true; {128357#true} is VALID [2022-04-28 10:11:20,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {128357#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); {128357#true} is VALID [2022-04-28 10:11:20,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {128357#true} call ULTIMATE.init(); {128357#true} is VALID [2022-04-28 10:11:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:11:20,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410929208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:20,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:20,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:11:20,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:20,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714831547] [2022-04-28 10:11:20,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714831547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:20,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:20,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:11:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825773460] [2022-04-28 10:11:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:20,403 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 46 [2022-04-28 10:11:20,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:20,403 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-28 10:11:20,423 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-28 10:11:20,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:11:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:11:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:11:20,424 INFO L87 Difference]: Start difference. First operand 200 states and 257 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-28 10:11:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:23,204 INFO L93 Difference]: Finished difference Result 239 states and 296 transitions. [2022-04-28 10:11:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:23,204 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 46 [2022-04-28 10:11:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:23,204 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-28 10:11:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2022-04-28 10:11:23,204 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-28 10:11:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2022-04-28 10:11:23,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 83 transitions. [2022-04-28 10:11:23,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:23,274 INFO L225 Difference]: With dead ends: 239 [2022-04-28 10:11:23,274 INFO L226 Difference]: Without dead ends: 218 [2022-04-28 10:11:23,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:11:23,274 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:23,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:11:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-28 10:11:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 201. [2022-04-28 10:11:24,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:24,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:24,018 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:24,018 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:24,020 INFO L93 Difference]: Finished difference Result 218 states and 275 transitions. [2022-04-28 10:11:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2022-04-28 10:11:24,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:24,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:24,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 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 218 states. [2022-04-28 10:11:24,020 INFO L87 Difference]: Start difference. First operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 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 218 states. [2022-04-28 10:11:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:24,023 INFO L93 Difference]: Finished difference Result 218 states and 275 transitions. [2022-04-28 10:11:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2022-04-28 10:11:24,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:24,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:24,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:24,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 196 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 258 transitions. [2022-04-28 10:11:24,025 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 258 transitions. Word has length 46 [2022-04-28 10:11:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:24,025 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 258 transitions. [2022-04-28 10:11:24,025 INFO L496 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-28 10:11:24,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 258 transitions. [2022-04-28 10:11:24,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 258 transitions. [2022-04-28 10:11:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 10:11:24,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:24,636 INFO L195 NwaCegarLoop]: trace histogram [29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:24,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-04-28 10:11:24,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-04-28 10:11:24,836 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1117000142, now seen corresponding path program 219 times [2022-04-28 10:11:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:24,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983144479] [2022-04-28 10:11:24,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:24,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1117000142, now seen corresponding path program 220 times [2022-04-28 10:11:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:24,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023265007] [2022-04-28 10:11:24,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {130074#(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); {130037#true} is VALID [2022-04-28 10:11:25,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:25,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {130074#(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); {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-28 10:11:25,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130042#(= main_~y~0 0)} is VALID [2022-04-28 10:11:25,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {130042#(= 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; {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:25,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {130043#(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; {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:25,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {130044#(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; {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:25,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {130045#(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; {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:25,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {130046#(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; {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:25,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {130047#(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; {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:25,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {130048#(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; {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:25,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {130049#(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; {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:25,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {130050#(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; {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:25,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {130051#(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; {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:25,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {130052#(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; {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {130053#(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; {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:25,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {130054#(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; {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:25,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {130055#(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; {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:25,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {130056#(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; {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:25,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {130057#(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; {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:25,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {130058#(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; {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:25,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {130059#(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; {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:25,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {130060#(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; {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:25,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {130061#(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; {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:25,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {130062#(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; {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:25,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {130063#(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; {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:11:25,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {130064#(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; {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:11:25,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {130065#(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; {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:25,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {130066#(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; {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:11:25,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {130067#(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; {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:11:25,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {130068#(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; {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:11:25,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {130069#(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; {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:11:25,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {130070#(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; {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:11:25,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:11:25,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-28 10:11:25,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {130072#(and (<= main_~z~0 29) (<= 29 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; {130073#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} is VALID [2022-04-28 10:11:25,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {130073#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-28 10:11:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:11:25,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:25,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023265007] [2022-04-28 10:11:25,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023265007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:25,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221264248] [2022-04-28 10:11:25,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:25,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:25,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:25,499 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:25,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-04-28 10:11:25,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:25,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:25,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 10:11:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:25,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130037#true} is VALID [2022-04-28 10:11:25,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#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); {130037#true} is VALID [2022-04-28 10:11:25,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-28 10:11:25,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-28 10:11:25,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-28 10:11:25,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130042#(= main_~y~0 0)} is VALID [2022-04-28 10:11:25,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {130042#(= 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; {130043#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:25,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {130043#(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; {130044#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:25,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {130044#(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; {130045#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:25,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {130045#(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; {130046#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:25,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {130046#(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; {130047#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:25,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {130047#(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; {130048#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:25,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {130048#(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; {130049#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:25,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {130049#(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; {130050#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:25,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {130050#(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; {130051#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:25,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {130051#(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; {130052#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:25,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {130052#(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; {130053#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {130053#(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; {130054#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:25,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {130054#(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; {130055#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:25,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {130055#(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; {130056#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:25,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {130056#(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; {130057#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:25,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {130057#(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; {130058#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:25,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {130058#(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; {130059#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:25,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {130059#(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; {130060#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:25,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {130060#(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; {130061#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:25,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {130061#(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; {130062#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:25,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {130062#(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; {130063#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:25,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {130063#(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; {130064#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:11:25,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {130064#(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; {130065#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:11:25,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {130065#(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; {130066#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:25,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {130066#(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; {130067#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:11:25,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {130067#(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; {130068#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:11:25,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {130068#(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; {130069#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:11:25,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {130069#(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; {130070#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:11:25,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {130070#(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; {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:11:25,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:11:25,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {130071#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {130072#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-28 10:11:25,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {130072#(and (<= main_~z~0 29) (<= 29 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; {130189#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-28 10:11:25,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {130189#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:25,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:25,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:25,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:25,999 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-28 10:11:25,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-28 10:11:25,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-28 10:11:25,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-28 10:11:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:11:25,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:27,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {130038#false} assume !false; {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {130038#false} assume 0 == ~cond; {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {130038#false} ~cond := #in~cond; {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L272 TraceCheckUtils]: 42: Hoare triple {130038#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {130038#false} assume !(~y~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {130038#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {130038#false} is VALID [2022-04-28 10:11:27,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {130235#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {130038#false} is VALID [2022-04-28 10:11:27,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {130239#(< 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; {130235#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:27,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {130239#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:27,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:27,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {130250#(< 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; {130243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:27,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {130254#(< 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; {130250#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:27,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {130258#(< 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; {130254#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:27,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {130262#(< 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; {130258#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:27,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {130266#(< 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; {130262#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:27,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {130270#(< 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; {130266#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:27,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {130274#(< 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; {130270#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:27,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {130278#(< 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; {130274#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:27,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {130282#(< 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; {130278#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:27,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {130286#(< 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; {130282#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:27,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {130290#(< 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; {130286#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:27,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {130294#(< 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; {130290#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:27,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {130298#(< 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; {130294#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:27,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {130302#(< 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; {130298#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:27,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {130306#(< 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; {130302#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:27,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {130310#(< 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; {130306#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:27,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {130314#(< 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; {130310#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:27,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {130318#(< 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; {130314#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:27,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {130322#(< 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; {130318#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:27,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {130326#(< 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; {130322#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:27,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {130330#(< 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; {130326#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:27,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {130334#(< 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; {130330#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:11:27,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {130338#(< 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; {130334#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:11:27,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {130342#(< 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; {130338#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:11:27,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {130346#(< 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; {130342#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:27,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {130350#(< 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; {130346#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:11:27,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {130354#(< 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; {130350#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:11:27,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {130358#(< 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; {130354#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:11:27,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {130362#(< 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; {130358#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:11:27,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {130037#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {130362#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-28 10:11:27,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {130037#true} call #t~ret11 := main(); {130037#true} is VALID [2022-04-28 10:11:27,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130037#true} {130037#true} #61#return; {130037#true} is VALID [2022-04-28 10:11:27,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {130037#true} assume true; {130037#true} is VALID [2022-04-28 10:11:27,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {130037#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); {130037#true} is VALID [2022-04-28 10:11:27,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {130037#true} call ULTIMATE.init(); {130037#true} is VALID [2022-04-28 10:11:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:11:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221264248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:27,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:27,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 10:11:27,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983144479] [2022-04-28 10:11:27,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983144479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:27,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:27,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 10:11:27,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465461575] [2022-04-28 10:11:27,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 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 46 [2022-04-28 10:11:27,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:27,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:27,573 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-28 10:11:27,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 10:11:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 10:11:27,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=3517, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:11:27,574 INFO L87 Difference]: Start difference. First operand 201 states and 258 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:34,977 INFO L93 Difference]: Finished difference Result 317 states and 460 transitions. [2022-04-28 10:11:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:11:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 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 46 [2022-04-28 10:11:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 193 transitions. [2022-04-28 10:11:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 193 transitions. [2022-04-28 10:11:34,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 193 transitions. [2022-04-28 10:11:35,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:35,137 INFO L225 Difference]: With dead ends: 317 [2022-04-28 10:11:35,137 INFO L226 Difference]: Without dead ends: 309 [2022-04-28 10:11:35,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2173, Invalid=7927, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 10:11:35,138 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 163 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:35,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 222 Invalid, 4445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4318 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 10:11:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-28 10:11:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 207. [2022-04-28 10:11:35,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:35,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:35,892 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:35,892 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:35,896 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2022-04-28 10:11:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 377 transitions. [2022-04-28 10:11:35,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:35,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:35,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 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 309 states. [2022-04-28 10:11:35,896 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 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 309 states. [2022-04-28 10:11:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:35,899 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2022-04-28 10:11:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 377 transitions. [2022-04-28 10:11:35,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:35,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:35,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:35,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.297029702970297) internal successors, (262), 202 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 266 transitions. [2022-04-28 10:11:35,902 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 266 transitions. Word has length 46 [2022-04-28 10:11:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:35,902 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 266 transitions. [2022-04-28 10:11:35,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:35,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 266 transitions. [2022-04-28 10:11:36,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-04-28 10:11:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:11:36,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:36,525 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:36,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-04-28 10:11:36,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-04-28 10:11:36,726 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 221 times [2022-04-28 10:11:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:36,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [500229095] [2022-04-28 10:11:36,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:36,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 222 times [2022-04-28 10:11:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:36,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61868383] [2022-04-28 10:11:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {132134#(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); {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {132134#(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); {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-28 10:11:37,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:37,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:37,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:37,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= 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; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:37,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= 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; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= 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; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= 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; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= 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; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:37,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= 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; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= 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; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:37,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:37,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:37,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:37,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:37,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:37,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:37,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:37,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:37,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:37,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:37,028 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:11:37,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {132132#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {132133#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:11:37,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {132133#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {132116#false} is VALID [2022-04-28 10:11:37,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-28 10:11:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61868383] [2022-04-28 10:11:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61868383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:37,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757008104] [2022-04-28 10:11:37,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:37,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:37,031 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:37,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-04-28 10:11:37,887 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:11:37,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:37,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:11:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:37,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:38,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#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); {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= 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; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:38,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= 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; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= 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; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= 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; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= 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; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:38,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= 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; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= 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; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:38,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:38,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:38,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:38,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:38,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:38,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:38,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:38,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,229 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:38,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:38,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {132271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132116#false} is VALID [2022-04-28 10:11:38,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-28 10:11:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:38,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:38,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {132116#false} assume !false; {132116#false} is VALID [2022-04-28 10:11:38,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {132271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132116#false} is VALID [2022-04-28 10:11:38,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:38,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:38,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:38,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:38,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:38,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:38,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:38,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132131#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:11:38,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {132130#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:11:38,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {132129#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:11:38,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {132128#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {132126#(<= 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; {132127#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {132125#(<= 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; {132126#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {132124#(<= 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; {132125#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:11:38,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {132123#(<= 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; {132124#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {132122#(<= 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; {132123#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {132121#(<= 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; {132122#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:38,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {132120#(<= 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; {132121#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:11:38,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {132115#true} assume !(~x~0 % 4294967296 > 0); {132120#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {132115#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; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {132115#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {132115#true} call #t~ret11 := main(); {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132115#true} {132115#true} #61#return; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {132115#true} assume true; {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {132115#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); {132115#true} is VALID [2022-04-28 10:11:38,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {132115#true} call ULTIMATE.init(); {132115#true} is VALID [2022-04-28 10:11:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757008104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:38,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2022-04-28 10:11:38,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [500229095] [2022-04-28 10:11:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [500229095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:38,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:11:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128950514] [2022-04-28 10:11:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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 47 [2022-04-28 10:11:38,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:38,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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-28 10:11:38,589 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-28 10:11:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:11:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:11:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:11:38,590 INFO L87 Difference]: Start difference. First operand 207 states and 266 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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-28 10:11:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:44,484 INFO L93 Difference]: Finished difference Result 692 states and 927 transitions. [2022-04-28 10:11:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:11:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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 47 [2022-04-28 10:11:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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-28 10:11:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-28 10:11:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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-28 10:11:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-28 10:11:44,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 77 transitions. [2022-04-28 10:11:44,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:44,571 INFO L225 Difference]: With dead ends: 692 [2022-04-28 10:11:44,572 INFO L226 Difference]: Without dead ends: 675 [2022-04-28 10:11:44,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:11:44,572 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:44,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 116 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:11:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-04-28 10:11:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 211. [2022-04-28 10:11:45,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:45,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:45,373 INFO L74 IsIncluded]: Start isIncluded. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:45,373 INFO L87 Difference]: Start difference. First operand 675 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:45,386 INFO L93 Difference]: Finished difference Result 675 states and 909 transitions. [2022-04-28 10:11:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 909 transitions. [2022-04-28 10:11:45,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:45,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:45,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 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 675 states. [2022-04-28 10:11:45,386 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 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 675 states. [2022-04-28 10:11:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:45,399 INFO L93 Difference]: Finished difference Result 675 states and 909 transitions. [2022-04-28 10:11:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 909 transitions. [2022-04-28 10:11:45,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:45,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:45,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:45,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-04-28 10:11:45,402 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 47 [2022-04-28 10:11:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-04-28 10:11:45,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 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-28 10:11:45,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 272 transitions. [2022-04-28 10:11:46,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-04-28 10:11:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:11:46,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:46,236 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:46,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:46,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,436 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 105952943, now seen corresponding path program 223 times [2022-04-28 10:11:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:46,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382598997] [2022-04-28 10:11:46,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:46,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 105952943, now seen corresponding path program 224 times [2022-04-28 10:11:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:46,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258147620] [2022-04-28 10:11:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {135630#(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); {135602#true} is VALID [2022-04-28 10:11:46,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-28 10:11:46,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-28 10:11:46,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:46,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {135630#(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); {135602#true} is VALID [2022-04-28 10:11:46,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-28 10:11:46,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-28 10:11:46,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-28 10:11:46,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135607#(= main_~y~0 0)} is VALID [2022-04-28 10:11:46,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {135607#(= 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; {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:46,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {135608#(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; {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:46,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {135609#(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; {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:46,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {135610#(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; {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:46,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {135611#(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; {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:46,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {135612#(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; {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:46,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {135613#(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; {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:46,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {135614#(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; {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:46,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {135615#(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; {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:46,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {135616#(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; {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:46,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {135617#(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; {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:46,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {135618#(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; {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:46,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:46,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {135620#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:46,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {135620#(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; {135621#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:46,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {135621#(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; {135622#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:46,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {135622#(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; {135623#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:46,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {135623#(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; {135624#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:46,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {135624#(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; {135625#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:46,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {135625#(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; {135626#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:46,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {135626#(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; {135627#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:46,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {135627#(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; {135628#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:46,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {135628#(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; {135629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {135629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-28 10:11:46,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-28 10:11:46,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-28 10:11:46,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-28 10:11:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:11:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258147620] [2022-04-28 10:11:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258147620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563283482] [2022-04-28 10:11:46,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:46,846 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:46,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-04-28 10:11:46,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:46,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:46,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 10:11:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:47,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135602#true} is VALID [2022-04-28 10:11:47,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#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); {135602#true} is VALID [2022-04-28 10:11:47,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-28 10:11:47,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-28 10:11:47,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-28 10:11:47,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135607#(= main_~y~0 0)} is VALID [2022-04-28 10:11:47,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {135607#(= 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; {135608#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:47,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {135608#(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; {135609#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:47,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {135609#(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; {135610#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:47,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {135610#(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; {135611#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:47,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {135611#(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; {135612#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:47,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {135612#(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; {135613#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:47,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {135613#(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; {135614#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {135614#(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; {135615#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:47,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {135615#(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; {135616#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {135616#(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; {135617#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:47,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {135617#(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; {135618#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:47,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {135618#(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; {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {135619#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {135691#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {135691#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135695#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:47,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {135695#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= 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; {135699#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:11:47,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {135699#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ 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; {135703#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {135703#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135707#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {135707#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135711#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:11:47,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {135711#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ 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; {135715#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-28 10:11:47,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {135715#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ 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; {135719#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ main_~z~0 4)))} is VALID [2022-04-28 10:11:47,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {135719#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 3)) (+ 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; {135723#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {135723#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {135727#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {135727#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !(~z~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-28 10:11:47,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-28 10:11:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:11:47,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:48,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {135603#false} assume !false; {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {135603#false} assume 0 == ~cond; {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {135603#false} ~cond := #in~cond; {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L272 TraceCheckUtils]: 43: Hoare triple {135603#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {135603#false} assume !(~y~0 % 4294967296 > 0); {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {135603#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:48,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {135803#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135603#false} is VALID [2022-04-28 10:11:48,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {135807#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135803#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:11:48,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {135811#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135807#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:48,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {135815#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135811#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:48,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {135819#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135815#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:48,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {135823#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135819#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:48,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {135827#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135823#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:48,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {135831#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135827#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:48,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {135835#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135831#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:48,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {135839#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {135835#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:48,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {135843#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {135839#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:11:48,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {135847#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {135843#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:11:48,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {135851#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135847#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:48,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {135855#(or (not (< 0 (mod (+ main_~y~0 4294967287) 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; {135851#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:48,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {135859#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135855#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:48,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {135863#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135859#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:48,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {135867#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135863#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:48,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {135871#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135867#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:48,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {135875#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135871#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:48,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {135879#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 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; {135875#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:48,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {135602#true} ~z~0 := ~y~0; {135879#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:11:48,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {135602#true} assume !(~x~0 % 4294967296 > 0); {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {135602#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; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {135602#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {135602#true} call #t~ret11 := main(); {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135602#true} {135602#true} #61#return; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {135602#true} assume true; {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {135602#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); {135602#true} is VALID [2022-04-28 10:11:48,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {135602#true} call ULTIMATE.init(); {135602#true} is VALID [2022-04-28 10:11:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 10:11:48,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563283482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:48,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:48,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 22] total 56 [2022-04-28 10:11:48,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:48,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382598997] [2022-04-28 10:11:48,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382598997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:48,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:48,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:11:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034202892] [2022-04-28 10:11:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:48,275 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 47 [2022-04-28 10:11:48,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:48,276 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-28 10:11:48,301 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-28 10:11:48,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:11:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:11:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2723, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:11:48,302 INFO L87 Difference]: Start difference. First operand 211 states and 272 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-28 10:11:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:51,732 INFO L93 Difference]: Finished difference Result 244 states and 305 transitions. [2022-04-28 10:11:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:11:51,732 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 47 [2022-04-28 10:11:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:51,733 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-28 10:11:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 78 transitions. [2022-04-28 10:11:51,733 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-28 10:11:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 78 transitions. [2022-04-28 10:11:51,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 78 transitions. [2022-04-28 10:11:51,795 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-28 10:11:51,797 INFO L225 Difference]: With dead ends: 244 [2022-04-28 10:11:51,797 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 10:11:51,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=750, Invalid=6906, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:11:51,798 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:51,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 125 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:11:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 10:11:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2022-04-28 10:11:52,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:52,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:52,591 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:52,591 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,595 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-28 10:11:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-28 10:11:52,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:52,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:52,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 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 226 states. [2022-04-28 10:11:52,595 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 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 226 states. [2022-04-28 10:11:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,598 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-28 10:11:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-28 10:11:52,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:52,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:52,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:52,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2022-04-28 10:11:52,602 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 47 [2022-04-28 10:11:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2022-04-28 10:11:52,603 INFO L496 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-28 10:11:52,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 273 transitions. [2022-04-28 10:11:53,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2022-04-28 10:11:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:11:53,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:53,307 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:53,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:53,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:53,508 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 272921791, now seen corresponding path program 225 times [2022-04-28 10:11:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603048658] [2022-04-28 10:11:53,511 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:53,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 272921791, now seen corresponding path program 226 times [2022-04-28 10:11:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977535224] [2022-04-28 10:11:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {137397#(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); {137370#true} is VALID [2022-04-28 10:11:53,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-28 10:11:53,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-28 10:11:53,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:53,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {137397#(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); {137370#true} is VALID [2022-04-28 10:11:53,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-28 10:11:53,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-28 10:11:53,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-28 10:11:53,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137375#(= main_~y~0 0)} is VALID [2022-04-28 10:11:53,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {137375#(= 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; {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:53,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {137376#(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; {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:53,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {137377#(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; {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:53,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {137378#(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; {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:53,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {137379#(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; {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:53,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {137380#(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; {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:53,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {137381#(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; {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:53,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {137382#(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; {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:53,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {137383#(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; {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:53,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {137384#(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; {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:53,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {137385#(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; {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:53,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {137386#(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; {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:53,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {137387#(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; {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:53,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:53,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:53,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {137389#(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; {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:53,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {137390#(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; {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:53,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {137391#(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; {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:53,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {137392#(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; {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:53,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {137393#(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; {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:53,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {137394#(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; {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:53,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {137395#(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; {137396#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {137396#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:53,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:53,922 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-28 10:11:53,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-28 10:11:53,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-28 10:11:53,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-28 10:11:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977535224] [2022-04-28 10:11:53,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977535224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105327597] [2022-04-28 10:11:53,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:53,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:53,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:53,923 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:53,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-04-28 10:11:53,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:53,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:53,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:11:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:53,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:54,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137370#true} is VALID [2022-04-28 10:11:54,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#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); {137370#true} is VALID [2022-04-28 10:11:54,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-28 10:11:54,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-28 10:11:54,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-28 10:11:54,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137375#(= main_~y~0 0)} is VALID [2022-04-28 10:11:54,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {137375#(= 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; {137376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:54,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {137376#(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; {137377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:54,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {137377#(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; {137378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:54,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {137378#(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; {137379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:54,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {137379#(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; {137380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:54,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {137380#(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; {137381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:54,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {137381#(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; {137382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:54,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {137382#(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; {137383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:54,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {137383#(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; {137384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:54,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {137384#(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; {137385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:54,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {137385#(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; {137386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:54,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {137386#(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; {137387#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:54,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {137387#(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; {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:54,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:54,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {137388#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {137389#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:54,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {137389#(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; {137390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:11:54,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {137390#(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; {137391#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:54,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {137391#(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; {137392#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:54,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {137392#(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; {137393#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:54,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {137393#(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; {137394#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:54,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {137394#(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; {137395#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:54,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {137395#(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; {137482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {137482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-28 10:11:54,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-28 10:11:54,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-28 10:11:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:54,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:55,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {137371#false} assume !false; {137371#false} is VALID [2022-04-28 10:11:55,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {137371#false} assume 0 == ~cond; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {137371#false} ~cond := #in~cond; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L272 TraceCheckUtils]: 43: Hoare triple {137371#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {137371#false} assume !(~y~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {137371#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {137371#false} is VALID [2022-04-28 10:11:55,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {137594#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {137371#false} is VALID [2022-04-28 10:11:55,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {137598#(< 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; {137594#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:55,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {137602#(< 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; {137598#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:55,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {137606#(< 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; {137602#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:55,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {137610#(< 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; {137606#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:55,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {137614#(< 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; {137610#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:55,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {137618#(< 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; {137614#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:55,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {137622#(< 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; {137618#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:55,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {137622#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:55,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:55,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {137633#(< 0 (mod (+ 4294967290 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; {137626#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:11:55,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {137637#(< 0 (mod (+ 4294967291 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; {137633#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:55,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {137641#(< 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; {137637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:55,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {137645#(< 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; {137641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:55,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {137649#(< 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; {137645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:55,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {137653#(< 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; {137649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:55,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {137657#(< 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; {137653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:55,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {137661#(< 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; {137657#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:55,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {137665#(< 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; {137661#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:55,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {137669#(< 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; {137665#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:55,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {137673#(< 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; {137669#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:55,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {137677#(< 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; {137673#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:55,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {137681#(< 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; {137677#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:55,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {137370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {137681#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:55,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {137370#true} call #t~ret11 := main(); {137370#true} is VALID [2022-04-28 10:11:55,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137370#true} {137370#true} #61#return; {137370#true} is VALID [2022-04-28 10:11:55,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {137370#true} assume true; {137370#true} is VALID [2022-04-28 10:11:55,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {137370#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); {137370#true} is VALID [2022-04-28 10:11:55,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {137370#true} call ULTIMATE.init(); {137370#true} is VALID [2022-04-28 10:11:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:11:55,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105327597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:55,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:55,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:11:55,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603048658] [2022-04-28 10:11:55,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603048658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:55,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:55,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605090148] [2022-04-28 10:11:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:55,085 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 47 [2022-04-28 10:11:55,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:55,085 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-28 10:11:55,120 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-28 10:11:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:11:55,121 INFO L87 Difference]: Start difference. First operand 212 states and 273 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-28 10:11:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:58,331 INFO L93 Difference]: Finished difference Result 247 states and 308 transitions. [2022-04-28 10:11:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:11:58,331 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 47 [2022-04-28 10:11:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:58,331 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-28 10:11:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 86 transitions. [2022-04-28 10:11:58,332 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-28 10:11:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 86 transitions. [2022-04-28 10:11:58,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 86 transitions. [2022-04-28 10:11:58,403 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-28 10:11:58,406 INFO L225 Difference]: With dead ends: 247 [2022-04-28 10:11:58,406 INFO L226 Difference]: Without dead ends: 228 [2022-04-28 10:11:58,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1216, Invalid=5590, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 10:11:58,406 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:58,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:11:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-28 10:11:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 213. [2022-04-28 10:11:59,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:59,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:59,212 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:59,212 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:59,214 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-28 10:11:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-28 10:11:59,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:59,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:59,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 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 228 states. [2022-04-28 10:11:59,215 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 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 228 states. [2022-04-28 10:11:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:59,217 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-28 10:11:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-28 10:11:59,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:59,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:59,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:59,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 208 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2022-04-28 10:11:59,220 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 47 [2022-04-28 10:11:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:59,220 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2022-04-28 10:11:59,220 INFO L496 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-28 10:11:59,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 274 transitions. [2022-04-28 10:11:59,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2022-04-28 10:11:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:11:59,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:59,934 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:59,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:00,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2022-04-28 10:12:00,139 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash 733969647, now seen corresponding path program 227 times [2022-04-28 10:12:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:00,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266360807] [2022-04-28 10:12:00,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:00,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 733969647, now seen corresponding path program 228 times [2022-04-28 10:12:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669210775] [2022-04-28 10:12:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:00,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {139174#(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); {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:00,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {139174#(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); {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-28 10:12:00,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139153#(= main_~y~0 0)} is VALID [2022-04-28 10:12:00,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {139153#(= 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; {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:00,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {139154#(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; {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:00,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {139155#(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; {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:00,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {139156#(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; {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:00,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {139157#(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; {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:00,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {139158#(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; {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:00,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {139159#(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; {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:00,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {139160#(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; {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:00,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {139161#(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; {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:00,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {139162#(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; {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:00,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {139163#(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; {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:00,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {139164#(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; {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:00,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {139165#(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; {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:00,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {139166#(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; {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:00,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:00,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:00,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:00,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {139169#(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; {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:00,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {139170#(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; {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:00,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {139171#(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; {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {139172#(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; {139173#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {139173#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-28 10:12:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669210775] [2022-04-28 10:12:00,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669210775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308971089] [2022-04-28 10:12:00,507 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:00,508 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:00,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-04-28 10:12:00,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:12:00,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:12:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:00,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:01,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139148#true} is VALID [2022-04-28 10:12:01,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#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); {139148#true} is VALID [2022-04-28 10:12:01,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-28 10:12:01,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-28 10:12:01,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-28 10:12:01,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139153#(= main_~y~0 0)} is VALID [2022-04-28 10:12:01,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {139153#(= 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; {139154#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:01,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {139154#(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; {139155#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:01,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {139155#(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; {139156#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:01,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {139156#(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; {139157#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:01,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {139157#(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; {139158#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:01,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {139158#(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; {139159#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:01,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {139159#(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; {139160#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:01,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {139160#(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; {139161#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:01,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {139161#(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; {139162#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:01,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {139162#(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; {139163#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:01,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {139163#(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; {139164#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:01,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {139164#(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; {139165#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:01,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {139165#(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; {139166#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:01,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {139166#(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; {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:01,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:01,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {139167#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:01,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {139168#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {139169#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:01,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {139169#(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; {139170#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:01,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {139170#(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; {139171#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:01,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {139171#(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; {139172#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {139172#(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; {139256#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {139256#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-28 10:12:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:01,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {139149#false} assume !false; {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {139149#false} assume 0 == ~cond; {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {139149#false} ~cond := #in~cond; {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L272 TraceCheckUtils]: 43: Hoare triple {139149#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {139149#false} assume !(~y~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {139149#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {139149#false} is VALID [2022-04-28 10:12:01,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {139374#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {139149#false} is VALID [2022-04-28 10:12:01,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {139378#(< 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; {139374#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:01,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {139382#(< 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; {139378#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:01,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {139386#(< 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; {139382#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:01,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {139390#(< 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; {139386#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:01,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {139394#(< 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; {139390#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:01,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {139394#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:01,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:01,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {139405#(< 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; {139398#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:01,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {139409#(< 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; {139405#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:01,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {139413#(< 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; {139409#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:01,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {139417#(< 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; {139413#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:01,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {139421#(< 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; {139417#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:01,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {139425#(< 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; {139421#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:01,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {139429#(< 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; {139425#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:01,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {139433#(< 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; {139429#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:01,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {139437#(< 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; {139433#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:01,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {139441#(< 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; {139437#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:01,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {139445#(< 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; {139441#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:01,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {139449#(< 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; {139445#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:01,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {139453#(< 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; {139449#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:01,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {139457#(< 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; {139453#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:01,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {139148#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {139457#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:01,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {139148#true} call #t~ret11 := main(); {139148#true} is VALID [2022-04-28 10:12:01,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139148#true} {139148#true} #61#return; {139148#true} is VALID [2022-04-28 10:12:01,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {139148#true} assume true; {139148#true} is VALID [2022-04-28 10:12:01,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {139148#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); {139148#true} is VALID [2022-04-28 10:12:01,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {139148#true} call ULTIMATE.init(); {139148#true} is VALID [2022-04-28 10:12:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308971089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:01,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:01,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:12:01,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266360807] [2022-04-28 10:12:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266360807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:01,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:01,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:12:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346003232] [2022-04-28 10:12:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:01,985 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 47 [2022-04-28 10:12:01,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:01,985 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-28 10:12:02,010 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-28 10:12:02,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:12:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:12:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:02,011 INFO L87 Difference]: Start difference. First operand 213 states and 274 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-28 10:12:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:05,249 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-04-28 10:12:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:12:05,250 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 47 [2022-04-28 10:12:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:05,250 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-28 10:12:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-28 10:12:05,250 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-28 10:12:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-28 10:12:05,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 89 transitions. [2022-04-28 10:12:05,322 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-28 10:12:05,324 INFO L225 Difference]: With dead ends: 250 [2022-04-28 10:12:05,324 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 10:12:05,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1149, Invalid=5013, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:12:05,325 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:05,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 10:12:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2022-04-28 10:12:06,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:06,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:06,157 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:06,157 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:06,159 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-28 10:12:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-28 10:12:06,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:06,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:06,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:12:06,160 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:12:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:06,162 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-28 10:12:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-28 10:12:06,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:06,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:06,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:06,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 209 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2022-04-28 10:12:06,164 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 47 [2022-04-28 10:12:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:06,165 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2022-04-28 10:12:06,165 INFO L496 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-28 10:12:06,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 275 transitions. [2022-04-28 10:12:06,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2022-04-28 10:12:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:12:06,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:06,875 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:06,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:07,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:07,075 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:07,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1751323009, now seen corresponding path program 229 times [2022-04-28 10:12:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:07,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513935892] [2022-04-28 10:12:07,077 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:07,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1751323009, now seen corresponding path program 230 times [2022-04-28 10:12:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908544291] [2022-04-28 10:12:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {140957#(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); {140932#true} is VALID [2022-04-28 10:12:07,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-28 10:12:07,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-28 10:12:07,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:07,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {140957#(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); {140932#true} is VALID [2022-04-28 10:12:07,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-28 10:12:07,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-28 10:12:07,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-28 10:12:07,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140937#(= main_~y~0 0)} is VALID [2022-04-28 10:12:07,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {140937#(= 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; {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:07,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {140938#(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; {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:07,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {140939#(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; {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:07,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {140940#(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; {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:07,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {140941#(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; {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:07,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {140942#(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; {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:07,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {140943#(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; {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:07,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {140944#(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; {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {140945#(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; {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:07,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {140946#(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; {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:07,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {140947#(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; {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:07,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {140948#(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; {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:07,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {140949#(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; {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:07,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {140950#(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; {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:07,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {140951#(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; {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:07,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:07,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:07,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {140953#(and (<= main_~z~0 15) (<= 15 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; {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:07,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:07,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {140955#(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; {140956#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {140956#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-28 10:12:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908544291] [2022-04-28 10:12:07,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908544291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206446810] [2022-04-28 10:12:07,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:07,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:07,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:07,432 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:07,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-04-28 10:12:07,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:07,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:07,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:12:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:07,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:07,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140932#true} is VALID [2022-04-28 10:12:07,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#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); {140932#true} is VALID [2022-04-28 10:12:07,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-28 10:12:07,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-28 10:12:07,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-28 10:12:07,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140937#(= main_~y~0 0)} is VALID [2022-04-28 10:12:07,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {140937#(= 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; {140938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:07,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {140938#(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; {140939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:07,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {140939#(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; {140940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:07,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {140940#(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; {140941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:07,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {140941#(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; {140942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:07,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {140942#(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; {140943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:07,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {140943#(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; {140944#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:07,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {140944#(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; {140945#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:07,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {140945#(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; {140946#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:07,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {140946#(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; {140947#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:07,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {140947#(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; {140948#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:07,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {140948#(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; {140949#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:07,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {140949#(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; {140950#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:07,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {140950#(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; {140951#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:07,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {140951#(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; {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:07,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:07,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {140952#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {140953#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:07,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {140953#(and (<= main_~z~0 15) (<= 15 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; {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:07,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {140954#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {140955#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {140955#(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; {141036#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {141036#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-28 10:12:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:07,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:08,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {140933#false} assume !false; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {140933#false} assume 0 == ~cond; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {140933#false} ~cond := #in~cond; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L272 TraceCheckUtils]: 43: Hoare triple {140933#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {140933#false} assume !(~y~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {140933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {140933#false} is VALID [2022-04-28 10:12:08,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {141160#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {140933#false} is VALID [2022-04-28 10:12:08,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {141164#(< 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; {141160#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:08,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {141168#(< 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; {141164#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:08,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {141172#(< 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; {141168#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:08,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {141172#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {141183#(< 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; {141176#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:08,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {141187#(< 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; {141183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:08,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {141191#(< 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; {141187#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:08,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {141195#(< 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; {141191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:08,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {141199#(< 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; {141195#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:08,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {141203#(< 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; {141199#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:08,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {141207#(< 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; {141203#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:08,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {141211#(< 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; {141207#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:08,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {141215#(< 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; {141211#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:08,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {141219#(< 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; {141215#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:08,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {141223#(< 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; {141219#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:08,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {141227#(< 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; {141223#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:08,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {141231#(< 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; {141227#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:08,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {141235#(< 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; {141231#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:08,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {141239#(< 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; {141235#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:08,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {140932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {141239#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:08,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {140932#true} call #t~ret11 := main(); {140932#true} is VALID [2022-04-28 10:12:08,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140932#true} {140932#true} #61#return; {140932#true} is VALID [2022-04-28 10:12:08,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {140932#true} assume true; {140932#true} is VALID [2022-04-28 10:12:08,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {140932#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); {140932#true} is VALID [2022-04-28 10:12:08,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {140932#true} call ULTIMATE.init(); {140932#true} is VALID [2022-04-28 10:12:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:08,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206446810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:08,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:12:08,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513935892] [2022-04-28 10:12:08,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513935892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:08,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:12:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660506705] [2022-04-28 10:12:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:08,519 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 47 [2022-04-28 10:12:08,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:08,519 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-28 10:12:08,539 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-28 10:12:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:12:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:12:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:12:08,540 INFO L87 Difference]: Start difference. First operand 214 states and 275 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-28 10:12:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:11,614 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2022-04-28 10:12:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:12:11,614 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 47 [2022-04-28 10:12:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:11,614 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-28 10:12:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-28 10:12:11,615 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-28 10:12:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-28 10:12:11,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 87 transitions. [2022-04-28 10:12:11,685 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-28 10:12:11,691 INFO L225 Difference]: With dead ends: 253 [2022-04-28 10:12:11,691 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 10:12:11,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=3881, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:12:11,692 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:11,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 122 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 10:12:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2022-04-28 10:12:12,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:12,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:12,513 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:12,513 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:12,515 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-04-28 10:12:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 293 transitions. [2022-04-28 10:12:12,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:12,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:12,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 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 232 states. [2022-04-28 10:12:12,516 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 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 232 states. [2022-04-28 10:12:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:12,518 INFO L93 Difference]: Finished difference Result 232 states and 293 transitions. [2022-04-28 10:12:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 293 transitions. [2022-04-28 10:12:12,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:12,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:12,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:12,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 210 states have internal predecessors, (272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2022-04-28 10:12:12,521 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 47 [2022-04-28 10:12:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:12,521 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2022-04-28 10:12:12,521 INFO L496 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-28 10:12:12,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 276 transitions. [2022-04-28 10:12:13,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2022-04-28 10:12:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:12:13,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:13,253 INFO L195 NwaCegarLoop]: trace histogram [30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:13,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:13,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:13,471 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash -276285137, now seen corresponding path program 231 times [2022-04-28 10:12:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [742951689] [2022-04-28 10:12:13,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:13,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash -276285137, now seen corresponding path program 232 times [2022-04-28 10:12:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:13,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409193204] [2022-04-28 10:12:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:14,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {142750#(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); {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:14,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {142750#(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); {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-28 10:12:14,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-28 10:12:14,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142717#(= main_~y~0 0)} is VALID [2022-04-28 10:12:14,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {142717#(= 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; {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:14,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {142718#(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; {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:14,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {142719#(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; {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:14,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {142720#(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; {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:14,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {142721#(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; {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:14,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {142722#(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; {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:14,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {142723#(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; {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:14,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {142724#(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; {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:14,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {142725#(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; {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:14,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {142726#(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; {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:14,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {142727#(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; {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:14,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {142728#(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; {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:14,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {142729#(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; {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:14,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {142730#(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; {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:14,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {142731#(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; {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:14,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {142732#(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; {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:14,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {142733#(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; {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:14,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {142734#(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; {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:14,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {142735#(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; {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:14,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {142736#(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; {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:14,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {142737#(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; {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:14,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {142738#(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; {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:14,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {142739#(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; {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:14,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {142740#(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; {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:14,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {142741#(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; {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:14,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {142742#(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; {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:14,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {142743#(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; {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:12:14,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {142744#(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; {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:12:14,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {142745#(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; {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:12:14,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:12:14,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:12:14,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} ~z~0 := ~y~0; {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142749#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {142749#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-28 10:12:14,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-28 10:12:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:12:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:14,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409193204] [2022-04-28 10:12:14,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409193204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:14,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993951611] [2022-04-28 10:12:14,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:14,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:14,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:14,163 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:14,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-04-28 10:12:14,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:14,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:14,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 10:12:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:14,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:14,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142712#true} is VALID [2022-04-28 10:12:14,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#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); {142712#true} is VALID [2022-04-28 10:12:14,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-28 10:12:14,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-28 10:12:14,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-28 10:12:14,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {142717#(= main_~y~0 0)} is VALID [2022-04-28 10:12:14,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {142717#(= 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; {142718#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:14,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {142718#(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; {142719#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:14,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {142719#(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; {142720#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:14,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {142720#(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; {142721#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:14,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {142721#(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; {142722#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:14,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {142722#(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; {142723#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:14,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {142723#(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; {142724#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:14,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {142724#(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; {142725#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:14,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {142725#(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; {142726#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:14,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {142726#(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; {142727#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:14,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {142727#(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; {142728#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:14,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {142728#(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; {142729#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:14,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {142729#(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; {142730#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:14,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {142730#(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; {142731#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:14,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {142731#(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; {142732#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:14,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {142732#(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; {142733#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:14,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {142733#(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; {142734#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:14,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {142734#(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; {142735#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:14,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {142735#(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; {142736#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:14,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {142736#(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; {142737#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:14,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {142737#(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; {142738#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:14,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {142738#(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; {142739#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:14,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {142739#(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; {142740#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:14,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {142740#(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; {142741#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:14,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {142741#(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; {142742#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:14,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {142742#(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; {142743#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:14,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {142743#(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; {142744#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:12:14,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {142744#(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; {142745#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:12:14,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {142745#(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; {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:12:14,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {142746#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:12:14,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:12:14,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {142747#(and (<= main_~y~0 30) (<= 30 main_~y~0))} ~z~0 := ~y~0; {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-28 10:12:14,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {142748#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {142868#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {142868#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-28 10:12:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:12:14,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {142713#false} assume !false; {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {142713#false} assume 0 == ~cond; {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {142713#false} ~cond := #in~cond; {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L272 TraceCheckUtils]: 43: Hoare triple {142713#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {142713#false} assume !(~y~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:16,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {142713#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {142713#false} is VALID [2022-04-28 10:12:16,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {142914#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {142713#false} is VALID [2022-04-28 10:12:16,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {142918#(< 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; {142914#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:16,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {142918#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:16,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:16,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {142929#(< 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; {142922#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:16,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {142933#(< 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; {142929#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:16,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {142937#(< 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; {142933#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:16,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {142941#(< 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; {142937#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:16,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {142945#(< 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; {142941#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:16,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {142949#(< 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; {142945#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:16,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {142953#(< 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; {142949#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:16,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {142957#(< 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; {142953#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:16,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {142961#(< 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; {142957#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:16,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {142965#(< 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; {142961#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:16,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {142969#(< 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; {142965#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:16,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {142973#(< 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; {142969#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:16,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {142977#(< 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; {142973#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:16,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {142981#(< 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; {142977#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:16,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {142985#(< 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; {142981#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:16,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {142989#(< 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; {142985#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:16,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {142993#(< 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; {142989#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:16,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {142997#(< 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; {142993#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:16,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {143001#(< 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; {142997#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:16,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {143005#(< 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; {143001#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:16,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {143009#(< 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; {143005#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:16,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {143013#(< 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; {143009#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:16,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {143017#(< 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; {143013#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:16,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {143021#(< 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; {143017#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:12:16,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {143025#(< 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; {143021#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:16,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {143029#(< 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; {143025#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:12:16,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {143033#(< 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; {143029#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:12:16,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {143037#(< 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; {143033#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:12:16,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {143041#(< 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; {143037#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:12:16,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {143045#(< 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; {143041#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-28 10:12:16,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {142712#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {143045#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:16,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {142712#true} call #t~ret11 := main(); {142712#true} is VALID [2022-04-28 10:12:16,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142712#true} {142712#true} #61#return; {142712#true} is VALID [2022-04-28 10:12:16,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {142712#true} assume true; {142712#true} is VALID [2022-04-28 10:12:16,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {142712#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); {142712#true} is VALID [2022-04-28 10:12:16,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {142712#true} call ULTIMATE.init(); {142712#true} is VALID [2022-04-28 10:12:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:12:16,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993951611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:16,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:16,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 10:12:16,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:16,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [742951689] [2022-04-28 10:12:16,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [742951689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:16,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:16,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 10:12:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256841342] [2022-04-28 10:12:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 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 47 [2022-04-28 10:12:16,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:16,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:16,323 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-28 10:12:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 10:12:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 10:12:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3726, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:12:16,324 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,336 INFO L93 Difference]: Finished difference Result 345 states and 504 transitions. [2022-04-28 10:12:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:12:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 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 47 [2022-04-28 10:12:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 200 transitions. [2022-04-28 10:12:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 200 transitions. [2022-04-28 10:12:24,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 200 transitions. [2022-04-28 10:12:24,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:24,504 INFO L225 Difference]: With dead ends: 345 [2022-04-28 10:12:24,505 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 10:12:24,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2306, Invalid=8406, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 10:12:24,505 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 171 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:24,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 230 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4648 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 10:12:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 10:12:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 221. [2022-04-28 10:12:25,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:25,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,349 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,350 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,353 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2022-04-28 10:12:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2022-04-28 10:12:25,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 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 337 states. [2022-04-28 10:12:25,354 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 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 337 states. [2022-04-28 10:12:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,357 INFO L93 Difference]: Finished difference Result 337 states and 410 transitions. [2022-04-28 10:12:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 410 transitions. [2022-04-28 10:12:25,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:25,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2022-04-28 10:12:25,360 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 47 [2022-04-28 10:12:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:25,360 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2022-04-28 10:12:25,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:25,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 284 transitions. [2022-04-28 10:12:26,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2022-04-28 10:12:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:26,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:26,071 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:26,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-04-28 10:12:26,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:26,272 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 609074559, now seen corresponding path program 233 times [2022-04-28 10:12:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:26,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486696899] [2022-04-28 10:12:26,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:26,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 609074559, now seen corresponding path program 234 times [2022-04-28 10:12:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:26,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212751509] [2022-04-28 10:12:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:26,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {144969#(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); {144940#true} is VALID [2022-04-28 10:12:26,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-28 10:12:26,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-28 10:12:26,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:26,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {144969#(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); {144940#true} is VALID [2022-04-28 10:12:26,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-28 10:12:26,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-28 10:12:26,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-28 10:12:26,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144945#(= main_~y~0 0)} is VALID [2022-04-28 10:12:26,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {144945#(= 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; {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:26,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {144946#(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; {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:26,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {144947#(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; {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:26,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {144948#(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; {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:26,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {144949#(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; {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:26,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {144950#(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; {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:26,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {144951#(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; {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:26,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {144952#(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; {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:26,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {144953#(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; {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:26,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {144954#(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; {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:26,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {144955#(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; {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:26,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:26,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {144957#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:26,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {144957#(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; {144958#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:26,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {144958#(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; {144959#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:26,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {144959#(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; {144960#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:26,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {144960#(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; {144961#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:26,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {144961#(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; {144962#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:26,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {144962#(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; {144963#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:26,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {144963#(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; {144964#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:26,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {144964#(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; {144965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:26,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {144965#(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; {144966#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:26,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {144966#(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; {144967#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:26,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {144967#(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; {144968#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {144968#(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; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {144941#false} assume !(~z~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {144941#false} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-28 10:12:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212751509] [2022-04-28 10:12:26,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212751509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037575844] [2022-04-28 10:12:26,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:26,701 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:26,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-04-28 10:12:27,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:12:27,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:27,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 10:12:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:27,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:27,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144940#true} is VALID [2022-04-28 10:12:27,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#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); {144940#true} is VALID [2022-04-28 10:12:27,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-28 10:12:27,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-28 10:12:27,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-28 10:12:27,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144945#(= main_~y~0 0)} is VALID [2022-04-28 10:12:27,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {144945#(= 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; {144946#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:27,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {144946#(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; {144947#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:27,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {144947#(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; {144948#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:27,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {144948#(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; {144949#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:27,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {144949#(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; {144950#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:27,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {144950#(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; {144951#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:27,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {144951#(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; {144952#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:27,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {144952#(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; {144953#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:27,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {144953#(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; {144954#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:27,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {144954#(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; {144955#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:27,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {144955#(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; {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {144956#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {145027#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {145027#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 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; {145031#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:27,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {145031#(and (<= main_~y~0 11) (<= 11 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; {145035#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {145035#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 2)) (<= 11 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; {145039#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:12:27,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {145039#(and (<= main_~y~0 11) (<= 11 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; {145043#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 4)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {145043#(and (<= main_~y~0 11) (= main_~y~0 (+ main_~z~0 4)) (<= 11 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; {145047#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {145047#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 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; {145051#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {145051#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 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; {145055#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {145055#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 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; {145059#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {145059#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 11 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; {145063#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {145063#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 11 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; {145067#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:27,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {145067#(and (<= main_~y~0 11) (<= 11 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; {145071#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {145071#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= 11 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; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {144941#false} assume !(~z~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {144941#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {144941#false} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-28 10:12:27,636 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-28 10:12:27,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-28 10:12:27,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-28 10:12:27,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-28 10:12:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:27,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:28,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {144941#false} assume !false; {144941#false} is VALID [2022-04-28 10:12:28,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {144941#false} assume 0 == ~cond; {144941#false} is VALID [2022-04-28 10:12:28,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {144941#false} ~cond := #in~cond; {144941#false} is VALID [2022-04-28 10:12:28,667 INFO L272 TraceCheckUtils]: 44: Hoare triple {144941#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144941#false} is VALID [2022-04-28 10:12:28,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {145138#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144941#false} is VALID [2022-04-28 10:12:28,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {145142#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145138#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:28,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {145146#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145142#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:28,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {145150#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145146#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:28,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {145154#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145150#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:28,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {145158#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145154#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {145162#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145158#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {145166#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145162#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {145170#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145166#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:12:28,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {145174#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145170#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:28,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {145178#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145174#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:12:28,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {145178#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-28 10:12:28,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !(~z~0 % 4294967296 > 0); {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-28 10:12:28,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {145189#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145182#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-28 10:12:28,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {145193#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145189#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:12:28,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {145197#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145193#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-28 10:12:28,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {145201#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145197#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:12:28,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {145205#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145201#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:12:28,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {145209#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145205#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:12:28,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {145213#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145209#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:12:28,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {145217#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145213#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:12:28,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {145221#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145217#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:12:28,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {145225#(or (< 0 (mod (+ main_~y~0 4294967285) 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; {145221#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:12:28,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {145229#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145225#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {145233#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {145229#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {144940#true} ~z~0 := ~y~0; {145233#(or (< 0 (mod (+ main_~y~0 4294967285) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {144940#true} assume !(~x~0 % 4294967296 > 0); {144940#true} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {144940#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; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {144940#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {144940#true} call #t~ret11 := main(); {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144940#true} {144940#true} #61#return; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {144940#true} assume true; {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {144940#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); {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {144940#true} call ULTIMATE.init(); {144940#true} is VALID [2022-04-28 10:12:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:28,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037575844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:28,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:28,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 63 [2022-04-28 10:12:28,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486696899] [2022-04-28 10:12:28,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486696899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:28,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:28,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:12:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914516795] [2022-04-28 10:12:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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 48 [2022-04-28 10:12:28,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:28,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 10:12:28,711 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-28 10:12:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:12:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:12:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=3327, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:12:28,713 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 10:12:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:31,173 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2022-04-28 10:12:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:12:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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 48 [2022-04-28 10:12:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 10:12:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-04-28 10:12:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 10:12:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2022-04-28 10:12:31,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 51 transitions. [2022-04-28 10:12:31,210 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-28 10:12:31,212 INFO L225 Difference]: With dead ends: 238 [2022-04-28 10:12:31,212 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 10:12:31,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1119, Invalid=6363, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 10:12:31,213 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:31,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 10:12:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-28 10:12:31,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:31,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,970 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,970 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:31,972 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-04-28 10:12:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-28 10:12:31,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:31,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:31,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 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 207 states. [2022-04-28 10:12:31,972 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 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 207 states. [2022-04-28 10:12:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:31,974 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-04-28 10:12:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-28 10:12:31,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:31,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:31,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:31,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.306930693069307) internal successors, (264), 202 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 268 transitions. [2022-04-28 10:12:31,978 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 268 transitions. Word has length 48 [2022-04-28 10:12:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:31,978 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 268 transitions. [2022-04-28 10:12:31,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 10:12:31,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 268 transitions. [2022-04-28 10:12:32,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2022-04-28 10:12:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:32,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:32,666 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:32,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:32,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:32,866 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1707131277, now seen corresponding path program 235 times [2022-04-28 10:12:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:32,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926192005] [2022-04-28 10:12:32,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:32,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1707131277, now seen corresponding path program 236 times [2022-04-28 10:12:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:32,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018011313] [2022-04-28 10:12:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {146674#(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); {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:33,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {146674#(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); {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-28 10:12:33,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-28 10:12:33,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146650#(= main_~y~0 0)} is VALID [2022-04-28 10:12:33,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {146650#(= 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; {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:33,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {146651#(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; {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:33,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {146652#(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; {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:33,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {146653#(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; {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:33,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {146654#(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; {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:33,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {146655#(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; {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:33,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {146656#(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; {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:33,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {146657#(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; {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:33,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {146658#(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; {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:33,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {146659#(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; {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:33,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {146660#(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; {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:33,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {146661#(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; {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {146663#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:33,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {146663#(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; {146664#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:33,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {146664#(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; {146665#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:33,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {146665#(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; {146666#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:33,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {146666#(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; {146667#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:33,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {146667#(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; {146668#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:33,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {146668#(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; {146669#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:33,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {146669#(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; {146670#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:33,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {146670#(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; {146671#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:33,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {146671#(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; {146672#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:33,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {146672#(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; {146673#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:33,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {146673#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-28 10:12:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018011313] [2022-04-28 10:12:33,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018011313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129724561] [2022-04-28 10:12:33,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:33,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:33,293 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:33,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-04-28 10:12:33,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:33,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:33,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-28 10:12:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:33,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146645#true} is VALID [2022-04-28 10:12:33,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#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); {146645#true} is VALID [2022-04-28 10:12:33,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-28 10:12:33,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-28 10:12:33,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-28 10:12:33,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146650#(= main_~y~0 0)} is VALID [2022-04-28 10:12:33,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {146650#(= 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; {146651#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:33,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {146651#(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; {146652#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:33,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {146652#(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; {146653#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:33,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {146653#(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; {146654#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:33,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {146654#(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; {146655#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:33,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {146655#(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; {146656#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:33,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {146656#(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; {146657#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:33,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {146657#(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; {146658#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:33,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {146658#(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; {146659#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:33,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {146659#(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; {146660#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:33,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {146660#(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; {146661#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:33,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {146661#(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; {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {146662#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {146735#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {146735#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:33,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {146739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= 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; {146743#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:12:33,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {146743#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ 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; {146747#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {146747#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146751#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {146751#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146755#(and (<= 12 main_~y~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {146755#(and (<= 12 main_~y~0) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146759#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {146759#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146763#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {146763#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146767#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {146767#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146771#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:33,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {146771#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146775#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {146775#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-28 10:12:33,918 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-28 10:12:33,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-28 10:12:33,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-28 10:12:33,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-28 10:12:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:33,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {146646#false} assume !false; {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {146646#false} assume 0 == ~cond; {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {146646#false} ~cond := #in~cond; {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L272 TraceCheckUtils]: 44: Hoare triple {146646#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {146646#false} assume !(~y~0 % 4294967296 > 0); {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {146646#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:34,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {146848#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146646#false} is VALID [2022-04-28 10:12:34,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {146852#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146848#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:12:34,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {146856#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146852#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:12:34,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {146860#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146856#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:12:34,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {146864#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146860#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:12:34,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {146868#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146864#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:34,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {146872#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146868#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:34,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {146876#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146872#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:34,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {146880#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146876#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:12:34,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {146884#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146880#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:34,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {146888#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {146884#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:12:34,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {146892#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {146888#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:12:34,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {146896#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {146892#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:12:34,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {146900#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146896#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:12:34,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {146904#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {146900#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:12:34,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {146908#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146904#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:12:34,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {146912#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146908#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:12:34,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {146916#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {146912#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:12:34,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {146920#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {146916#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:34,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {146924#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {146920#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:12:34,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {146928#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {146924#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {146932#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {146928#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {146645#true} ~z~0 := ~y~0; {146932#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {146645#true} assume !(~x~0 % 4294967296 > 0); {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {146645#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; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {146645#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {146645#true} call #t~ret11 := main(); {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146645#true} {146645#true} #61#return; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {146645#true} assume true; {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {146645#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); {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {146645#true} call ULTIMATE.init(); {146645#true} is VALID [2022-04-28 10:12:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 10:12:34,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129724561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:34,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:34,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 24] total 60 [2022-04-28 10:12:34,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:34,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926192005] [2022-04-28 10:12:34,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926192005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:34,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:34,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:12:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612214056] [2022-04-28 10:12:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:34,891 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 48 [2022-04-28 10:12:34,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:34,891 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-28 10:12:34,918 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-28 10:12:34,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:12:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:12:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3132, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:12:34,919 INFO L87 Difference]: Start difference. First operand 207 states and 268 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-28 10:12:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:37,568 INFO L93 Difference]: Finished difference Result 240 states and 301 transitions. [2022-04-28 10:12:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:12:37,568 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 48 [2022-04-28 10:12:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:37,568 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-28 10:12:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-28 10:12:37,569 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-28 10:12:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2022-04-28 10:12:37,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 66 transitions. [2022-04-28 10:12:37,639 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-28 10:12:37,642 INFO L225 Difference]: With dead ends: 240 [2022-04-28 10:12:37,642 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 10:12:37,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=682, Invalid=6290, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 10:12:37,643 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:37,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 10:12:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2022-04-28 10:12:38,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:38,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:38,411 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:38,411 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:38,413 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2022-04-28 10:12:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2022-04-28 10:12:38,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:38,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:38,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 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 222 states. [2022-04-28 10:12:38,414 INFO L87 Difference]: Start difference. First operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 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 222 states. [2022-04-28 10:12:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:38,416 INFO L93 Difference]: Finished difference Result 222 states and 283 transitions. [2022-04-28 10:12:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2022-04-28 10:12:38,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:38,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:38,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:38,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2022-04-28 10:12:38,418 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 48 [2022-04-28 10:12:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:38,418 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2022-04-28 10:12:38,418 INFO L496 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-28 10:12:38,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 269 transitions. [2022-04-28 10:12:39,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2022-04-28 10:12:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:39,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:39,079 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:39,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-04-28 10:12:39,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-04-28 10:12:39,291 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1475687295, now seen corresponding path program 237 times [2022-04-28 10:12:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531830651] [2022-04-28 10:12:39,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:39,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1475687295, now seen corresponding path program 238 times [2022-04-28 10:12:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:39,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622875349] [2022-04-28 10:12:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {148411#(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); {148383#true} is VALID [2022-04-28 10:12:39,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:39,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {148411#(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); {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-28 10:12:39,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148388#(= main_~y~0 0)} is VALID [2022-04-28 10:12:39,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {148388#(= 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; {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:39,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {148389#(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; {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:39,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {148390#(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; {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:39,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {148391#(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; {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:39,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {148392#(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; {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:39,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {148393#(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; {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:39,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {148394#(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; {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:39,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {148395#(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; {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:39,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {148396#(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; {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:39,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {148397#(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; {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:39,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {148398#(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; {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:39,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {148399#(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; {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:39,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {148400#(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; {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:39,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:39,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:39,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {148402#(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; {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:39,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {148403#(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; {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:39,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {148404#(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; {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:39,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {148405#(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; {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:39,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {148406#(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; {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:39,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {148407#(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; {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:39,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {148408#(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; {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:39,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {148409#(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; {148410#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {148410#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:39,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:39,703 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-28 10:12:39,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-28 10:12:39,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-28 10:12:39,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-28 10:12:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:12:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622875349] [2022-04-28 10:12:39,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622875349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792052797] [2022-04-28 10:12:39,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:39,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:39,704 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:39,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-04-28 10:12:39,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:39,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:39,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:12:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:39,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:40,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148383#true} is VALID [2022-04-28 10:12:40,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#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); {148383#true} is VALID [2022-04-28 10:12:40,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-28 10:12:40,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-28 10:12:40,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-28 10:12:40,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148388#(= main_~y~0 0)} is VALID [2022-04-28 10:12:40,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {148388#(= 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; {148389#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:40,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {148389#(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; {148390#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:40,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {148390#(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; {148391#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:40,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {148391#(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; {148392#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:40,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {148392#(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; {148393#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:40,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {148393#(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; {148394#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:40,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {148394#(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; {148395#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:40,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {148395#(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; {148396#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:40,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {148396#(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; {148397#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:40,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {148397#(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; {148398#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:40,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {148398#(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; {148399#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:40,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {148399#(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; {148400#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:40,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {148400#(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; {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:40,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:40,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {148401#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {148402#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:40,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {148402#(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; {148403#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:40,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {148403#(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; {148404#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:40,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {148404#(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; {148405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:40,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {148405#(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; {148406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:40,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {148406#(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; {148407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:40,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {148407#(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; {148408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:40,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {148408#(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; {148409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:40,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {148409#(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; {148499#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {148499#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-28 10:12:40,116 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-28 10:12:40,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-28 10:12:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:12:40,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {148384#false} assume !false; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {148384#false} assume 0 == ~cond; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {148384#false} ~cond := #in~cond; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L272 TraceCheckUtils]: 44: Hoare triple {148384#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {148384#false} assume !(~y~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {148384#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {148384#false} is VALID [2022-04-28 10:12:40,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {148611#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {148384#false} is VALID [2022-04-28 10:12:40,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {148615#(< 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; {148611#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:40,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {148619#(< 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; {148615#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:40,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {148623#(< 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; {148619#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:40,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {148627#(< 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; {148623#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:40,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {148631#(< 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; {148627#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:40,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {148635#(< 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; {148631#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:40,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {148639#(< 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; {148635#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:40,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {148643#(< 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; {148639#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:12:40,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {148643#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:40,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {148654#(< 0 (mod (+ main_~y~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; {148647#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {148658#(< 0 (mod (+ 4294967290 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; {148654#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:12:40,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {148662#(< 0 (mod (+ 4294967291 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; {148658#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {148666#(< 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; {148662#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {148670#(< 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; {148666#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {148674#(< 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; {148670#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:40,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {148678#(< 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; {148674#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:40,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {148682#(< 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; {148678#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:40,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {148686#(< 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; {148682#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:40,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {148690#(< 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; {148686#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:40,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {148694#(< 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; {148690#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:40,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {148698#(< 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; {148694#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:40,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {148702#(< 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; {148698#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:40,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {148383#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {148702#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:40,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {148383#true} call #t~ret11 := main(); {148383#true} is VALID [2022-04-28 10:12:40,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148383#true} {148383#true} #61#return; {148383#true} is VALID [2022-04-28 10:12:40,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {148383#true} assume true; {148383#true} is VALID [2022-04-28 10:12:40,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {148383#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); {148383#true} is VALID [2022-04-28 10:12:40,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {148383#true} call ULTIMATE.init(); {148383#true} is VALID [2022-04-28 10:12:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:12:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792052797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:40,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:12:40,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:40,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531830651] [2022-04-28 10:12:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531830651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:40,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:12:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095957893] [2022-04-28 10:12:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:40,935 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 48 [2022-04-28 10:12:40,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:40,936 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-28 10:12:40,959 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-28 10:12:40,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:12:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:12:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2075, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:12:40,959 INFO L87 Difference]: Start difference. First operand 208 states and 269 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-28 10:12:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:44,151 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2022-04-28 10:12:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:12:44,151 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 48 [2022-04-28 10:12:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:44,151 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-28 10:12:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-28 10:12:44,152 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-28 10:12:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-28 10:12:44,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 78 transitions. [2022-04-28 10:12:44,215 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-28 10:12:44,218 INFO L225 Difference]: With dead ends: 243 [2022-04-28 10:12:44,218 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 10:12:44,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1127, Invalid=5353, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 10:12:44,218 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:44,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 10:12:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 209. [2022-04-28 10:12:44,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:44,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:44,991 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:44,991 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:44,993 INFO L93 Difference]: Finished difference Result 224 states and 285 transitions. [2022-04-28 10:12:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2022-04-28 10:12:44,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:44,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:44,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 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 224 states. [2022-04-28 10:12:44,994 INFO L87 Difference]: Start difference. First operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 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 224 states. [2022-04-28 10:12:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:44,996 INFO L93 Difference]: Finished difference Result 224 states and 285 transitions. [2022-04-28 10:12:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2022-04-28 10:12:44,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:44,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:44,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:44,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 270 transitions. [2022-04-28 10:12:44,999 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 270 transitions. Word has length 48 [2022-04-28 10:12:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:44,999 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 270 transitions. [2022-04-28 10:12:44,999 INFO L496 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-28 10:12:44,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 209 states and 270 transitions. [2022-04-28 10:12:45,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 270 transitions. [2022-04-28 10:12:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:45,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:45,675 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:45,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:45,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-04-28 10:12:45,875 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1539800179, now seen corresponding path program 239 times [2022-04-28 10:12:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:45,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1290052856] [2022-04-28 10:12:45,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:45,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1539800179, now seen corresponding path program 240 times [2022-04-28 10:12:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:45,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018954864] [2022-04-28 10:12:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {150164#(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); {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:46,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {150164#(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); {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-28 10:12:46,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150142#(= main_~y~0 0)} is VALID [2022-04-28 10:12:46,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {150142#(= 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; {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:46,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {150143#(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; {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:46,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {150144#(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; {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:46,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {150145#(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; {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:46,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {150146#(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; {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:46,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {150147#(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; {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:46,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {150148#(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; {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:46,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {150149#(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; {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:46,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {150150#(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; {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:46,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {150151#(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; {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:46,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {150152#(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; {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:46,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {150153#(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; {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:46,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {150154#(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; {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:46,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {150155#(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; {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:46,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:46,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:46,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:46,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {150158#(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; {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:46,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {150159#(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; {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:46,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {150160#(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; {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:46,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {150161#(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; {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:46,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {150162#(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; {150163#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:46,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {150163#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:46,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-28 10:12:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018954864] [2022-04-28 10:12:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018954864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446454205] [2022-04-28 10:12:46,256 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:46,257 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:46,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-04-28 10:12:46,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:12:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:46,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:12:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:46,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:47,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150137#true} is VALID [2022-04-28 10:12:47,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#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); {150137#true} is VALID [2022-04-28 10:12:47,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-28 10:12:47,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-28 10:12:47,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-28 10:12:47,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150142#(= main_~y~0 0)} is VALID [2022-04-28 10:12:47,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {150142#(= 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; {150143#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:47,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {150143#(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; {150144#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:47,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {150144#(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; {150145#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:47,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {150145#(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; {150146#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:47,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {150146#(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; {150147#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:47,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {150147#(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; {150148#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:47,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {150148#(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; {150149#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:47,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {150149#(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; {150150#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:47,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {150150#(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; {150151#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:47,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {150151#(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; {150152#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:47,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {150152#(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; {150153#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:47,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {150153#(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; {150154#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:47,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {150154#(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; {150155#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:47,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {150155#(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; {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:47,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:47,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {150156#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:47,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {150157#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {150158#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:47,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {150158#(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; {150159#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:47,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {150159#(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; {150160#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:47,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {150160#(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; {150161#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:47,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {150161#(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; {150162#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:47,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {150162#(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; {150249#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:47,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {150249#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:47,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-28 10:12:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:47,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {150138#false} assume !false; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {150138#false} assume 0 == ~cond; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {150138#false} ~cond := #in~cond; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L272 TraceCheckUtils]: 44: Hoare triple {150138#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {150138#false} assume !(~y~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {150138#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {150138#false} is VALID [2022-04-28 10:12:47,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {150367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {150138#false} is VALID [2022-04-28 10:12:47,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {150371#(< 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; {150367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:47,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {150375#(< 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; {150371#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:47,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {150379#(< 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; {150375#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:47,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {150383#(< 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; {150379#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:47,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {150387#(< 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; {150383#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:47,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {150391#(< 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; {150387#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:47,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {150391#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:47,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {150402#(< 0 (mod (+ 4294967291 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; {150395#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {150406#(< 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; {150402#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {150410#(< 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; {150406#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {150414#(< 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; {150410#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:47,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {150418#(< 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; {150414#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:47,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {150422#(< 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; {150418#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:47,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {150426#(< 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; {150422#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:47,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {150430#(< 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; {150426#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:47,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {150434#(< 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; {150430#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:47,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {150438#(< 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; {150434#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:47,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {150442#(< 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; {150438#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:47,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {150446#(< 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; {150442#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {150450#(< 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; {150446#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:47,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {150454#(< 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; {150450#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:47,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {150137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {150454#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:47,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {150137#true} call #t~ret11 := main(); {150137#true} is VALID [2022-04-28 10:12:47,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150137#true} {150137#true} #61#return; {150137#true} is VALID [2022-04-28 10:12:47,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {150137#true} assume true; {150137#true} is VALID [2022-04-28 10:12:47,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {150137#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); {150137#true} is VALID [2022-04-28 10:12:47,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {150137#true} call ULTIMATE.init(); {150137#true} is VALID [2022-04-28 10:12:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:12:47,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446454205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:47,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:47,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:12:47,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:47,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1290052856] [2022-04-28 10:12:47,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1290052856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:47,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:47,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:12:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522933146] [2022-04-28 10:12:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:47,982 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 48 [2022-04-28 10:12:47,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:47,983 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-28 10:12:48,005 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-28 10:12:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:12:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:12:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:12:48,006 INFO L87 Difference]: Start difference. First operand 209 states and 270 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-28 10:12:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:51,288 INFO L93 Difference]: Finished difference Result 246 states and 307 transitions. [2022-04-28 10:12:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:12:51,288 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 48 [2022-04-28 10:12:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:51,289 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-28 10:12:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 10:12:51,289 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-28 10:12:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 10:12:51,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-28 10:12:51,360 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-28 10:12:51,362 INFO L225 Difference]: With dead ends: 246 [2022-04-28 10:12:51,362 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 10:12:51,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1186, Invalid=5294, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 10:12:51,363 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:51,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:12:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 10:12:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2022-04-28 10:12:52,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:52,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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-28 10:12:52,155 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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-28 10:12:52,155 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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-28 10:12:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,157 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-28 10:12:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-28 10:12:52,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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 226 states. [2022-04-28 10:12:52,157 INFO L87 Difference]: Start difference. First operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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 226 states. [2022-04-28 10:12:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:52,160 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2022-04-28 10:12:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2022-04-28 10:12:52,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:52,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:52,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:52,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 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-28 10:12:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2022-04-28 10:12:52,162 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 271 transitions. Word has length 48 [2022-04-28 10:12:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:52,163 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 271 transitions. [2022-04-28 10:12:52,163 INFO L496 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-28 10:12:52,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 271 transitions. [2022-04-28 10:12:52,851 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-28 10:12:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 271 transitions. [2022-04-28 10:12:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:52,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:52,852 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:52,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:53,053 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash -950650497, now seen corresponding path program 241 times [2022-04-28 10:12:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:53,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798132240] [2022-04-28 10:12:53,056 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:53,056 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -950650497, now seen corresponding path program 242 times [2022-04-28 10:12:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311704325] [2022-04-28 10:12:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:53,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {151931#(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); {151905#true} is VALID [2022-04-28 10:12:53,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-28 10:12:53,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-28 10:12:53,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151931#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:53,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {151931#(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); {151905#true} is VALID [2022-04-28 10:12:53,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-28 10:12:53,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-28 10:12:53,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-28 10:12:53,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151910#(= main_~y~0 0)} is VALID [2022-04-28 10:12:53,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {151910#(= 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; {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:53,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {151911#(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; {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:53,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {151912#(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; {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:53,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {151913#(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; {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:53,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {151914#(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; {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:53,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {151915#(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; {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:53,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {151916#(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; {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:53,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {151917#(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; {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:53,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {151918#(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; {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:53,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {151919#(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; {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:53,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {151920#(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; {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:53,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {151921#(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; {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:53,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {151922#(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; {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:53,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {151923#(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; {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:53,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {151924#(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; {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:53,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:53,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:53,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {151926#(and (<= main_~z~0 15) (<= 15 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; {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:53,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:53,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {151928#(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; {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:53,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {151929#(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; {151930#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:53,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {151930#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-28 10:12:53,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-28 10:12:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:53,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311704325] [2022-04-28 10:12:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311704325] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97158352] [2022-04-28 10:12:53,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:53,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:53,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:53,450 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:53,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-04-28 10:12:53,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:53,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:53,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:12:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:53,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:53,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151905#true} is VALID [2022-04-28 10:12:53,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#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); {151905#true} is VALID [2022-04-28 10:12:53,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-28 10:12:53,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-28 10:12:53,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-28 10:12:53,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151910#(= main_~y~0 0)} is VALID [2022-04-28 10:12:53,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {151910#(= 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; {151911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:53,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {151911#(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; {151912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:53,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {151912#(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; {151913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:53,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {151913#(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; {151914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:53,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {151914#(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; {151915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:53,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {151915#(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; {151916#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:53,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {151916#(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; {151917#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:53,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {151917#(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; {151918#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:53,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {151918#(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; {151919#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:53,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {151919#(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; {151920#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:53,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {151920#(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; {151921#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:53,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {151921#(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; {151922#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:53,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {151922#(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; {151923#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:53,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {151923#(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; {151924#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:53,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {151924#(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; {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:53,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:53,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {151925#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {151926#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:53,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {151926#(and (<= main_~z~0 15) (<= 15 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; {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:12:53,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {151927#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151928#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:12:53,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {151928#(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; {151929#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:53,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {151929#(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; {152013#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {152013#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-28 10:12:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:53,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {151906#false} assume !false; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {151906#false} assume 0 == ~cond; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {151906#false} ~cond := #in~cond; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L272 TraceCheckUtils]: 44: Hoare triple {151906#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {151906#false} assume !(~y~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {151906#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {151906#false} is VALID [2022-04-28 10:12:54,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {152137#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151906#false} is VALID [2022-04-28 10:12:54,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {152141#(< 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; {152137#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:54,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {152145#(< 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; {152141#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:54,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {152149#(< 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; {152145#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:54,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {152153#(< 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; {152149#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:54,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {152153#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:54,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:54,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {152164#(< 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; {152157#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:54,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {152168#(< 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; {152164#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:54,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {152172#(< 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; {152168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:54,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {152176#(< 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; {152172#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:54,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {152180#(< 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; {152176#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:54,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {152184#(< 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; {152180#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:54,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {152188#(< 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; {152184#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:54,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {152192#(< 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; {152188#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:54,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {152196#(< 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; {152192#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:54,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {152200#(< 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; {152196#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:54,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {152204#(< 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; {152200#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:54,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {152208#(< 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; {152204#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:54,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {152212#(< 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; {152208#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:54,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {152216#(< 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; {152212#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:54,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {152220#(< 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; {152216#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:54,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {151905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {152220#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:54,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {151905#true} call #t~ret11 := main(); {151905#true} is VALID [2022-04-28 10:12:54,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151905#true} {151905#true} #61#return; {151905#true} is VALID [2022-04-28 10:12:54,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {151905#true} assume true; {151905#true} is VALID [2022-04-28 10:12:54,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {151905#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); {151905#true} is VALID [2022-04-28 10:12:54,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {151905#true} call ULTIMATE.init(); {151905#true} is VALID [2022-04-28 10:12:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:12:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97158352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:54,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:54,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:12:54,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:54,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798132240] [2022-04-28 10:12:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798132240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:54,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:54,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:12:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809284452] [2022-04-28 10:12:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:54,591 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 48 [2022-04-28 10:12:54,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:54,591 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-28 10:12:54,613 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-28 10:12:54,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:12:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:12:54,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:54,613 INFO L87 Difference]: Start difference. First operand 210 states and 271 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-28 10:12:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:57,728 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-04-28 10:12:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:12:57,728 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 48 [2022-04-28 10:12:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:57,728 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-28 10:12:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 87 transitions. [2022-04-28 10:12:57,729 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-28 10:12:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 87 transitions. [2022-04-28 10:12:57,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 87 transitions. [2022-04-28 10:12:57,799 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-28 10:12:57,801 INFO L225 Difference]: With dead ends: 249 [2022-04-28 10:12:57,801 INFO L226 Difference]: Without dead ends: 228 [2022-04-28 10:12:57,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=4612, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:12:57,802 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:57,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:12:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-28 10:12:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2022-04-28 10:12:58,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:58,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:58,602 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:58,602 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,604 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-28 10:12:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-28 10:12:58,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:58,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:58,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 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 228 states. [2022-04-28 10:12:58,605 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 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 228 states. [2022-04-28 10:12:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,607 INFO L93 Difference]: Finished difference Result 228 states and 289 transitions. [2022-04-28 10:12:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2022-04-28 10:12:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:58,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:58,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 206 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 272 transitions. [2022-04-28 10:12:58,611 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 272 transitions. Word has length 48 [2022-04-28 10:12:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:58,612 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 272 transitions. [2022-04-28 10:12:58,612 INFO L496 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-28 10:12:58,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 272 transitions. [2022-04-28 10:12:59,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 272 transitions. [2022-04-28 10:12:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:12:59,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:59,343 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:59,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2022-04-28 10:12:59,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-04-28 10:12:59,544 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 535213453, now seen corresponding path program 243 times [2022-04-28 10:12:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:59,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872967621] [2022-04-28 10:12:59,546 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:59,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 535213453, now seen corresponding path program 244 times [2022-04-28 10:12:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:59,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185994066] [2022-04-28 10:12:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:59,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {153702#(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); {153677#true} is VALID [2022-04-28 10:12:59,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-28 10:12:59,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-28 10:12:59,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:59,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {153702#(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); {153677#true} is VALID [2022-04-28 10:12:59,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-28 10:12:59,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-28 10:12:59,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-28 10:12:59,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153682#(= main_~y~0 0)} is VALID [2022-04-28 10:12:59,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {153682#(= 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; {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:59,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {153683#(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; {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:59,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {153684#(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; {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:59,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {153685#(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; {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:59,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {153686#(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; {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:59,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {153687#(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; {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:59,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {153688#(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; {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:59,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {153689#(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; {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:59,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {153690#(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; {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:59,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {153691#(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; {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:59,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {153692#(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; {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:59,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {153693#(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; {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:59,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {153694#(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; {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:59,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {153695#(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; {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:59,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {153696#(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; {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:59,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {153697#(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; {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:59,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:59,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:59,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:59,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {153700#(and (<= main_~z~0 15) (<= 15 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; {153701#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:59,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {153701#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:12:59,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-28 10:12:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:12:59,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:59,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185994066] [2022-04-28 10:12:59,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185994066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:59,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254615290] [2022-04-28 10:12:59,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:59,893 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:59,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-04-28 10:12:59,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:59,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:59,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:12:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:59,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:00,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153677#true} is VALID [2022-04-28 10:13:00,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#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); {153677#true} is VALID [2022-04-28 10:13:00,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-28 10:13:00,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-28 10:13:00,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-28 10:13:00,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153682#(= main_~y~0 0)} is VALID [2022-04-28 10:13:00,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {153682#(= 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; {153683#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:00,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {153683#(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; {153684#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:00,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {153684#(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; {153685#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:00,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {153685#(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; {153686#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:00,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {153686#(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; {153687#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:00,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {153687#(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; {153688#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:00,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {153688#(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; {153689#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:00,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {153689#(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; {153690#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:00,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {153690#(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; {153691#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:00,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {153691#(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; {153692#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:00,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {153692#(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; {153693#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:00,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {153693#(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; {153694#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:00,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {153694#(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; {153695#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:00,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {153695#(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; {153696#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:00,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {153696#(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; {153697#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:00,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {153697#(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; {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:00,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:00,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {153698#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:13:00,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {153699#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {153700#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:13:00,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {153700#(and (<= main_~z~0 15) (<= 15 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; {153781#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {153781#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-28 10:13:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:13:00,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:00,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {153678#false} assume !false; {153678#false} is VALID [2022-04-28 10:13:00,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {153678#false} assume 0 == ~cond; {153678#false} is VALID [2022-04-28 10:13:00,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {153678#false} ~cond := #in~cond; {153678#false} is VALID [2022-04-28 10:13:00,969 INFO L272 TraceCheckUtils]: 44: Hoare triple {153678#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {153678#false} is VALID [2022-04-28 10:13:00,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {153678#false} assume !(~y~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:13:00,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {153678#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {153678#false} is VALID [2022-04-28 10:13:00,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {153911#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {153678#false} is VALID [2022-04-28 10:13:00,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {153915#(< 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; {153911#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:00,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {153919#(< 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; {153915#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:00,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {153919#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:00,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:00,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {153930#(< 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; {153923#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:00,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {153934#(< 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; {153930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:00,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {153938#(< 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; {153934#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:00,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {153942#(< 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; {153938#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:00,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {153946#(< 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; {153942#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:00,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {153950#(< 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; {153946#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:00,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {153954#(< 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; {153950#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:00,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {153958#(< 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; {153954#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:00,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {153962#(< 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; {153958#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:00,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {153966#(< 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; {153962#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:00,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {153970#(< 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; {153966#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:00,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {153974#(< 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; {153970#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:00,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {153978#(< 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; {153974#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:00,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {153982#(< 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; {153978#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:00,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {153986#(< 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; {153982#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:00,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {153990#(< 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; {153986#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:00,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {153677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {153990#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:00,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {153677#true} call #t~ret11 := main(); {153677#true} is VALID [2022-04-28 10:13:00,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153677#true} {153677#true} #61#return; {153677#true} is VALID [2022-04-28 10:13:00,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {153677#true} assume true; {153677#true} is VALID [2022-04-28 10:13:00,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {153677#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); {153677#true} is VALID [2022-04-28 10:13:00,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {153677#true} call ULTIMATE.init(); {153677#true} is VALID [2022-04-28 10:13:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:13:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254615290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:00,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:00,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:13:00,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872967621] [2022-04-28 10:13:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872967621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:00,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:00,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:13:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862294098] [2022-04-28 10:13:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:00,985 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 48 [2022-04-28 10:13:00,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:00,986 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-28 10:13:01,006 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-28 10:13:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:13:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:13:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:13:01,007 INFO L87 Difference]: Start difference. First operand 211 states and 272 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-28 10:13:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:03,969 INFO L93 Difference]: Finished difference Result 252 states and 313 transitions. [2022-04-28 10:13:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:13:03,969 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 48 [2022-04-28 10:13:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:03,969 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-28 10:13:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-28 10:13:03,970 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-28 10:13:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-28 10:13:03,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 85 transitions. [2022-04-28 10:13:04,040 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-28 10:13:04,043 INFO L225 Difference]: With dead ends: 252 [2022-04-28 10:13:04,043 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 10:13:04,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=902, Invalid=3520, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:13:04,043 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:04,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:13:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 10:13:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2022-04-28 10:13:04,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:04,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:04,843 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:04,843 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:04,845 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-28 10:13:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-28 10:13:04,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:04,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:04,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:13:04,846 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 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 230 states. [2022-04-28 10:13:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:04,848 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-04-28 10:13:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 291 transitions. [2022-04-28 10:13:04,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:04,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:04,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:04,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2022-04-28 10:13:04,851 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 48 [2022-04-28 10:13:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:04,851 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2022-04-28 10:13:04,851 INFO L496 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-28 10:13:04,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 273 transitions. [2022-04-28 10:13:05,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2022-04-28 10:13:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 10:13:05,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:05,554 INFO L195 NwaCegarLoop]: trace histogram [31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:05,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-04-28 10:13:05,759 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -518455826, now seen corresponding path program 245 times [2022-04-28 10:13:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663769506] [2022-04-28 10:13:05,762 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:05,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -518455826, now seen corresponding path program 246 times [2022-04-28 10:13:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:05,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376605213] [2022-04-28 10:13:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:06,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {155484#(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); {155445#true} is VALID [2022-04-28 10:13:06,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-28 10:13:06,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-28 10:13:06,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:06,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {155484#(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); {155445#true} is VALID [2022-04-28 10:13:06,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-28 10:13:06,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-28 10:13:06,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-28 10:13:06,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155450#(= main_~y~0 0)} is VALID [2022-04-28 10:13:06,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {155450#(= 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; {155451#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:06,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {155451#(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; {155452#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:06,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {155452#(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; {155453#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:06,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {155453#(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; {155454#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:06,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {155454#(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; {155455#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:06,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {155455#(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; {155456#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:06,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {155456#(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; {155457#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:06,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {155457#(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; {155458#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:06,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {155458#(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; {155459#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:06,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {155459#(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; {155460#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {155460#(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; {155461#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:06,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {155461#(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; {155462#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:06,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {155462#(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; {155463#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:06,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {155463#(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; {155464#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:06,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {155464#(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; {155465#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:06,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {155465#(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; {155466#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:06,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {155466#(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; {155467#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:06,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {155467#(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; {155468#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:06,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {155468#(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; {155469#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:06,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {155469#(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; {155470#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:06,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {155470#(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; {155471#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:06,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {155471#(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; {155472#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:06,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {155472#(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; {155473#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:06,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {155473#(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; {155474#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:13:06,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {155474#(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; {155475#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:13:06,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {155475#(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; {155476#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:13:06,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {155476#(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; {155477#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:06,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {155477#(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; {155478#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:13:06,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {155478#(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; {155479#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:13:06,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {155479#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155480#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:13:06,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {155480#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 10:13:06,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 10:13:06,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {155481#(and (<= main_~y~0 31) (<= 31 main_~y~0))} ~z~0 := ~y~0; {155482#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-28 10:13:06,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {155482#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {155483#(and (<= 30 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {155483#(and (<= 30 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {155446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {155446#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-28 10:13:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:13:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:06,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376605213] [2022-04-28 10:13:06,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376605213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:06,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628977601] [2022-04-28 10:13:06,541 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:06,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:06,542 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:06,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-04-28 10:13:06,582 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:13:06,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:06,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:13:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:06,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:06,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#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); {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 33: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {155445#true} assume !(~x~0 % 4294967296 > 0); {155445#true} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {155445#true} ~z~0 := ~y~0; {155602#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:06,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {155602#(= 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; {155606#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:13:06,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {155606#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:06,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155614#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:06,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {155614#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-28 10:13:06,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-28 10:13:06,798 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-28 10:13:06,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-28 10:13:06,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-28 10:13:06,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-28 10:13:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 10:13:06,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:06,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {155446#false} assume !false; {155446#false} is VALID [2022-04-28 10:13:06,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {155446#false} assume 0 == ~cond; {155446#false} is VALID [2022-04-28 10:13:06,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {155446#false} ~cond := #in~cond; {155446#false} is VALID [2022-04-28 10:13:06,971 INFO L272 TraceCheckUtils]: 44: Hoare triple {155446#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {155446#false} is VALID [2022-04-28 10:13:06,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {155446#false} assume !(~y~0 % 4294967296 > 0); {155446#false} is VALID [2022-04-28 10:13:06,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {155614#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155446#false} is VALID [2022-04-28 10:13:06,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {155614#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:06,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {155654#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {155610#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {155658#(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; {155654#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {155445#true} ~z~0 := ~y~0; {155658#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {155445#true} assume !(~x~0 % 4294967296 > 0); {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {155445#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; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {155445#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {155445#true} call #t~ret11 := main(); {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155445#true} {155445#true} #61#return; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {155445#true} assume true; {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {155445#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); {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {155445#true} call ULTIMATE.init(); {155445#true} is VALID [2022-04-28 10:13:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 10:13:06,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628977601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:06,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:06,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 6, 6] total 43 [2022-04-28 10:13:06,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663769506] [2022-04-28 10:13:06,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663769506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:06,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:06,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 10:13:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691825497] [2022-04-28 10:13:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 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 48 [2022-04-28 10:13:06,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:06,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:07,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:07,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 10:13:07,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:07,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 10:13:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1710, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:13:07,007 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:15,594 INFO L93 Difference]: Finished difference Result 343 states and 503 transitions. [2022-04-28 10:13:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:13:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 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 48 [2022-04-28 10:13:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 203 transitions. [2022-04-28 10:13:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 203 transitions. [2022-04-28 10:13:15,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 203 transitions. [2022-04-28 10:13:15,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:15,765 INFO L225 Difference]: With dead ends: 343 [2022-04-28 10:13:15,765 INFO L226 Difference]: Without dead ends: 335 [2022-04-28 10:13:15,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=5751, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 10:13:15,766 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 171 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5007 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:15,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 240 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5007 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 10:13:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-04-28 10:13:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 218. [2022-04-28 10:13:16,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:16,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:16,600 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:16,600 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:16,604 INFO L93 Difference]: Finished difference Result 335 states and 408 transitions. [2022-04-28 10:13:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2022-04-28 10:13:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:16,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 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 335 states. [2022-04-28 10:13:16,605 INFO L87 Difference]: Start difference. First operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 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 335 states. [2022-04-28 10:13:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:16,610 INFO L93 Difference]: Finished difference Result 335 states and 408 transitions. [2022-04-28 10:13:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 408 transitions. [2022-04-28 10:13:16,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:16,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:16,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:16,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.300469483568075) internal successors, (277), 213 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2022-04-28 10:13:16,613 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 48 [2022-04-28 10:13:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:16,613 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2022-04-28 10:13:16,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:16,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 281 transitions. [2022-04-28 10:13:17,468 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-28 10:13:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2022-04-28 10:13:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:17,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:17,469 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:17,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-04-28 10:13:17,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-04-28 10:13:17,672 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -195947921, now seen corresponding path program 247 times [2022-04-28 10:13:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592404168] [2022-04-28 10:13:17,674 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:17,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -195947921, now seen corresponding path program 248 times [2022-04-28 10:13:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737918802] [2022-04-28 10:13:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:18,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {157670#(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); {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:18,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {157670#(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); {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-28 10:13:18,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-28 10:13:18,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157645#(= main_~y~0 0)} is VALID [2022-04-28 10:13:18,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {157645#(= 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; {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:18,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {157646#(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; {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:18,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {157647#(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; {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:18,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {157648#(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; {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:18,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {157649#(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; {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:18,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {157650#(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; {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:18,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {157651#(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; {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:18,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {157652#(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; {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:18,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {157653#(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; {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:18,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {157654#(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; {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:18,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {157655#(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; {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:18,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {157656#(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; {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {157658#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:18,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {157658#(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; {157659#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:18,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {157659#(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; {157660#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:18,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {157660#(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; {157661#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:18,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {157661#(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; {157662#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:18,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {157662#(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; {157663#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:18,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {157663#(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; {157664#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:18,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {157664#(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; {157665#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:18,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {157665#(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; {157666#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:18,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {157666#(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; {157667#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:18,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {157667#(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; {157668#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:18,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {157668#(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; {157669#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:18,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {157669#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-28 10:13:18,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-28 10:13:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737918802] [2022-04-28 10:13:18,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737918802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354130627] [2022-04-28 10:13:18,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:18,135 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:18,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-04-28 10:13:18,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:18,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-28 10:13:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:18,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:18,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157640#true} is VALID [2022-04-28 10:13:18,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#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); {157640#true} is VALID [2022-04-28 10:13:18,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-28 10:13:18,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-28 10:13:18,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-28 10:13:18,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157645#(= main_~y~0 0)} is VALID [2022-04-28 10:13:18,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {157645#(= 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; {157646#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:18,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {157646#(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; {157647#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:18,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {157647#(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; {157648#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:18,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {157648#(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; {157649#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:18,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {157649#(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; {157650#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:18,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {157650#(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; {157651#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:18,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {157651#(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; {157652#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:18,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {157652#(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; {157653#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:18,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {157653#(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; {157654#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:18,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {157654#(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; {157655#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:18,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {157655#(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; {157656#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:18,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {157656#(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; {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {157657#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {157731#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {157731#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157735#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:18,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {157735#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= 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; {157739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:13:18,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {157739#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ 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; {157743#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {157743#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157747#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {157747#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157751#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {157751#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157755#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {157755#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157759#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 4)) (+ main_~z~0 3)))} is VALID [2022-04-28 10:13:18,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {157759#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~y~0 (- 4)) (+ 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; {157763#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {157763#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157767#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {157767#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 7))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157771#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 9) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:18,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {157771#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 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; {157775#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {157775#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} assume !(~z~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {157641#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-28 10:13:18,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-28 10:13:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:18,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:19,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {157641#false} assume !false; {157641#false} is VALID [2022-04-28 10:13:19,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {157641#false} assume 0 == ~cond; {157641#false} is VALID [2022-04-28 10:13:19,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {157641#false} ~cond := #in~cond; {157641#false} is VALID [2022-04-28 10:13:19,887 INFO L272 TraceCheckUtils]: 45: Hoare triple {157641#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157641#false} is VALID [2022-04-28 10:13:19,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {157641#false} assume !(~y~0 % 4294967296 > 0); {157641#false} is VALID [2022-04-28 10:13:19,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {157845#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157641#false} is VALID [2022-04-28 10:13:19,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {157849#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157845#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:19,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {157853#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157849#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:19,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {157857#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157853#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:19,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {157861#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157857#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:19,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {157865#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157861#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {157869#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157865#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {157873#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157869#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {157877#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157873#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:19,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {157881#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157877#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {157885#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157881#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:13:19,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {157889#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {157885#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:13:19,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {157893#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {157889#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-28 10:13:19,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {157897#(or (not (< 0 (mod (+ main_~y~0 4294967285) 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; {157893#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:19,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {157901#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157897#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:19,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {157905#(or (not (< 0 (mod (+ main_~y~0 4294967285) 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; {157901#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:19,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {157909#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157905#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:19,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {157913#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157909#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {157917#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157913#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {157921#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157917#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {157925#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157921#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:19,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {157929#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {157925#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {157933#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157929#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {157937#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157933#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {157640#true} ~z~0 := ~y~0; {157937#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {157640#true} assume !(~x~0 % 4294967296 > 0); {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {157640#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; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {157640#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {157640#true} call #t~ret11 := main(); {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157640#true} {157640#true} #61#return; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {157640#true} assume true; {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {157640#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); {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {157640#true} call ULTIMATE.init(); {157640#true} is VALID [2022-04-28 10:13:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:19,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354130627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:19,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:19,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 26] total 64 [2022-04-28 10:13:19,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592404168] [2022-04-28 10:13:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592404168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:19,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:19,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:13:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894007241] [2022-04-28 10:13:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:19,912 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 49 [2022-04-28 10:13:19,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:19,912 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-28 10:13:19,942 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-28 10:13:19,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:13:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:13:19,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=3569, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:13:19,943 INFO L87 Difference]: Start difference. First operand 218 states and 281 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-28 10:13:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,000 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2022-04-28 10:13:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:13:23,000 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 49 [2022-04-28 10:13:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:23,000 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-28 10:13:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 67 transitions. [2022-04-28 10:13:23,001 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-28 10:13:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 67 transitions. [2022-04-28 10:13:23,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 67 transitions. [2022-04-28 10:13:23,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:23,065 INFO L225 Difference]: With dead ends: 251 [2022-04-28 10:13:23,065 INFO L226 Difference]: Without dead ends: 233 [2022-04-28 10:13:23,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=767, Invalid=7065, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 10:13:23,065 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:23,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:13:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-28 10:13:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2022-04-28 10:13:23,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:23,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:23,898 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:23,899 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,901 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2022-04-28 10:13:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2022-04-28 10:13:23,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 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 233 states. [2022-04-28 10:13:23,902 INFO L87 Difference]: Start difference. First operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 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 233 states. [2022-04-28 10:13:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,904 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2022-04-28 10:13:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2022-04-28 10:13:23,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:23,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 214 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2022-04-28 10:13:23,907 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 49 [2022-04-28 10:13:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:23,907 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2022-04-28 10:13:23,907 INFO L496 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-28 10:13:23,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 282 transitions. [2022-04-28 10:13:24,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-28 10:13:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:24,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:24,638 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:24,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:24,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-04-28 10:13:24,838 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 106712255, now seen corresponding path program 249 times [2022-04-28 10:13:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:24,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893420537] [2022-04-28 10:13:24,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:24,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 106712255, now seen corresponding path program 250 times [2022-04-28 10:13:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:24,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104902620] [2022-04-28 10:13:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:25,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {159485#(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); {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159485#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:25,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {159485#(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); {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-28 10:13:25,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159461#(= main_~y~0 0)} is VALID [2022-04-28 10:13:25,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {159461#(= 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; {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:25,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {159462#(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; {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:25,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {159463#(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; {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:25,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {159464#(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; {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:25,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {159465#(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; {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:25,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {159466#(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; {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:25,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {159467#(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; {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:25,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {159468#(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; {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:25,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {159469#(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; {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:25,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {159470#(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; {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:25,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {159471#(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; {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:25,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {159472#(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; {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:25,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {159473#(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; {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:25,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:25,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:25,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {159475#(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; {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:25,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {159476#(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; {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:25,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {159477#(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; {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:25,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {159478#(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; {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:25,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {159479#(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; {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:25,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {159480#(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; {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:25,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {159481#(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; {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:25,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {159482#(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; {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:25,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {159483#(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; {159484#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:25,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {159484#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:25,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-28 10:13:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104902620] [2022-04-28 10:13:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104902620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161713932] [2022-04-28 10:13:25,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:25,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:25,275 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:25,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-04-28 10:13:25,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:25,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:25,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:13:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:25,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:25,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159456#true} is VALID [2022-04-28 10:13:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#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); {159456#true} is VALID [2022-04-28 10:13:25,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-28 10:13:25,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-28 10:13:25,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-28 10:13:25,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159461#(= main_~y~0 0)} is VALID [2022-04-28 10:13:25,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {159461#(= 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; {159462#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:25,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {159462#(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; {159463#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:25,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {159463#(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; {159464#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:25,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {159464#(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; {159465#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:25,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {159465#(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; {159466#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:25,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {159466#(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; {159467#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:25,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {159467#(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; {159468#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:25,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {159468#(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; {159469#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:25,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {159469#(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; {159470#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:25,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {159470#(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; {159471#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:25,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {159471#(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; {159472#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:25,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {159472#(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; {159473#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:25,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {159473#(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; {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:25,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:25,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {159474#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {159475#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:25,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {159475#(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; {159476#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:25,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {159476#(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; {159477#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:25,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {159477#(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; {159478#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:25,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {159478#(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; {159479#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:25,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {159479#(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; {159480#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:25,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {159480#(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; {159481#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:25,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {159481#(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; {159482#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:25,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {159482#(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; {159483#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {159483#(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; {159576#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {159576#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-28 10:13:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:25,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:26,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {159457#false} assume !false; {159457#false} is VALID [2022-04-28 10:13:26,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {159457#false} assume 0 == ~cond; {159457#false} is VALID [2022-04-28 10:13:26,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {159457#false} ~cond := #in~cond; {159457#false} is VALID [2022-04-28 10:13:26,551 INFO L272 TraceCheckUtils]: 45: Hoare triple {159457#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {159457#false} is VALID [2022-04-28 10:13:26,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {159457#false} assume !(~y~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:26,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {159457#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {159457#false} is VALID [2022-04-28 10:13:26,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {159688#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {159457#false} is VALID [2022-04-28 10:13:26,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {159692#(< 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; {159688#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:26,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {159696#(< 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; {159692#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:26,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {159700#(< 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; {159696#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:26,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {159704#(< 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; {159700#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:26,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {159708#(< 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; {159704#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:26,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {159712#(< 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; {159708#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:26,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {159716#(< 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; {159712#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:26,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {159720#(< 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; {159716#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:26,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {159724#(< 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; {159720#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:26,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {159724#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-28 10:13:26,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:13:26,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {159735#(< 0 (mod (+ 4294967288 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; {159728#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:13:26,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {159739#(< 0 (mod (+ main_~y~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; {159735#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:26,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {159743#(< 0 (mod (+ 4294967290 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; {159739#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:26,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {159747#(< 0 (mod (+ 4294967291 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; {159743#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:26,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {159751#(< 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; {159747#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:26,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {159755#(< 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; {159751#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:26,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {159759#(< 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; {159755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:26,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {159763#(< 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; {159759#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:26,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {159767#(< 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; {159763#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:26,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {159771#(< 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; {159767#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:26,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {159775#(< 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; {159771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:26,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {159779#(< 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; {159775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:26,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {159783#(< 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; {159779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:26,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {159456#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {159783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:26,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {159456#true} call #t~ret11 := main(); {159456#true} is VALID [2022-04-28 10:13:26,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159456#true} {159456#true} #61#return; {159456#true} is VALID [2022-04-28 10:13:26,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {159456#true} assume true; {159456#true} is VALID [2022-04-28 10:13:26,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {159456#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); {159456#true} is VALID [2022-04-28 10:13:26,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {159456#true} call ULTIMATE.init(); {159456#true} is VALID [2022-04-28 10:13:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161713932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:26,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:13:26,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893420537] [2022-04-28 10:13:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893420537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:13:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92745673] [2022-04-28 10:13:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:26,569 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 49 [2022-04-28 10:13:26,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:26,570 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-28 10:13:26,594 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-28 10:13:26,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:13:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:13:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2257, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:13:26,595 INFO L87 Difference]: Start difference. First operand 219 states and 282 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-28 10:13:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:29,840 INFO L93 Difference]: Finished difference Result 254 states and 317 transitions. [2022-04-28 10:13:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 10:13:29,841 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 49 [2022-04-28 10:13:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:29,841 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-28 10:13:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2022-04-28 10:13:29,841 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-28 10:13:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2022-04-28 10:13:29,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 80 transitions. [2022-04-28 10:13:29,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:29,907 INFO L225 Difference]: With dead ends: 254 [2022-04-28 10:13:29,907 INFO L226 Difference]: Without dead ends: 235 [2022-04-28 10:13:29,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1219, Invalid=5921, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:13:29,908 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:13:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-28 10:13:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2022-04-28 10:13:30,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:30,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:30,840 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:30,840 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:30,842 INFO L93 Difference]: Finished difference Result 235 states and 298 transitions. [2022-04-28 10:13:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2022-04-28 10:13:30,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:30,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:30,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 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 235 states. [2022-04-28 10:13:30,843 INFO L87 Difference]: Start difference. First operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 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 235 states. [2022-04-28 10:13:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:30,845 INFO L93 Difference]: Finished difference Result 235 states and 298 transitions. [2022-04-28 10:13:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2022-04-28 10:13:30,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:30,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:30,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:30,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 215 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 283 transitions. [2022-04-28 10:13:30,848 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 283 transitions. Word has length 49 [2022-04-28 10:13:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:30,848 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 283 transitions. [2022-04-28 10:13:30,848 INFO L496 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-28 10:13:30,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 220 states and 283 transitions. [2022-04-28 10:13:31,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 283 transitions. [2022-04-28 10:13:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:31,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:31,592 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:31,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:31,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:31,795 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:31,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 987779247, now seen corresponding path program 251 times [2022-04-28 10:13:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:31,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428699406] [2022-04-28 10:13:31,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:31,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 987779247, now seen corresponding path program 252 times [2022-04-28 10:13:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305907484] [2022-04-28 10:13:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:32,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {161316#(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); {161288#true} is VALID [2022-04-28 10:13:32,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-28 10:13:32,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-28 10:13:32,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:32,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {161316#(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); {161288#true} is VALID [2022-04-28 10:13:32,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-28 10:13:32,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-28 10:13:32,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-28 10:13:32,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161293#(= main_~y~0 0)} is VALID [2022-04-28 10:13:32,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {161293#(= 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; {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:32,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {161294#(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; {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:32,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {161295#(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; {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:32,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {161296#(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; {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:32,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {161297#(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; {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:32,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {161298#(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; {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:32,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {161299#(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; {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:32,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {161300#(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; {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:32,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {161301#(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; {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:32,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {161302#(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; {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:32,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {161303#(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; {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:32,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {161304#(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; {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:32,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {161305#(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; {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:32,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {161306#(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; {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:32,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:32,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:32,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:32,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {161309#(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; {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:32,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {161310#(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; {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:32,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {161311#(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; {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:32,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {161312#(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; {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:32,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {161313#(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; {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:32,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {161314#(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; {161315#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:32,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {161315#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-28 10:13:32,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-28 10:13:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:13:32,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:32,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305907484] [2022-04-28 10:13:32,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305907484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:32,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691938977] [2022-04-28 10:13:32,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:32,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:32,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:32,228 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:32,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-04-28 10:13:32,672 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:13:32,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:32,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:13:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:32,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:33,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161288#true} is VALID [2022-04-28 10:13:33,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#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); {161288#true} is VALID [2022-04-28 10:13:33,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-28 10:13:33,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-28 10:13:33,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-28 10:13:33,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161293#(= main_~y~0 0)} is VALID [2022-04-28 10:13:33,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {161293#(= 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; {161294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:33,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {161294#(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; {161295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:33,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {161295#(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; {161296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:33,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {161296#(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; {161297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:33,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {161297#(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; {161298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:33,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {161298#(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; {161299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:33,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {161299#(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; {161300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:33,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {161300#(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; {161301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:33,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {161301#(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; {161302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:33,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {161302#(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; {161303#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:33,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {161303#(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; {161304#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:33,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {161304#(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; {161305#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:33,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {161305#(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; {161306#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:33,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {161306#(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; {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:33,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:33,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {161307#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:33,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {161308#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {161309#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:33,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {161309#(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; {161310#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:33,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {161310#(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; {161311#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:33,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {161311#(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; {161312#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:33,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {161312#(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; {161313#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:33,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {161313#(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; {161314#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {161314#(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; {161404#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {161404#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-28 10:13:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:13:33,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:33,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {161289#false} assume !false; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {161289#false} assume 0 == ~cond; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {161289#false} ~cond := #in~cond; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L272 TraceCheckUtils]: 45: Hoare triple {161289#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {161289#false} assume !(~y~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {161289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {161289#false} is VALID [2022-04-28 10:13:33,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {161522#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {161289#false} is VALID [2022-04-28 10:13:33,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {161526#(< 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; {161522#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:33,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {161530#(< 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; {161526#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:33,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {161534#(< 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; {161530#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:33,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {161538#(< 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; {161534#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:33,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {161542#(< 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; {161538#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:33,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {161546#(< 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; {161542#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:33,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {161550#(< 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; {161546#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:33,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {161550#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:33,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:33,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {161561#(< 0 (mod (+ 4294967290 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; {161554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:13:33,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {161565#(< 0 (mod (+ 4294967291 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; {161561#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:33,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {161569#(< 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; {161565#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:33,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {161573#(< 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; {161569#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:33,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {161577#(< 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; {161573#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:33,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {161581#(< 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; {161577#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:33,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {161585#(< 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; {161581#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:33,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {161589#(< 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; {161585#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:33,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {161593#(< 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; {161589#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:33,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {161597#(< 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; {161593#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:33,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {161601#(< 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; {161597#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:33,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {161605#(< 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; {161601#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:33,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {161609#(< 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; {161605#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:33,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {161613#(< 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; {161609#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:33,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {161288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {161613#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:33,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {161288#true} call #t~ret11 := main(); {161288#true} is VALID [2022-04-28 10:13:33,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161288#true} {161288#true} #61#return; {161288#true} is VALID [2022-04-28 10:13:33,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {161288#true} assume true; {161288#true} is VALID [2022-04-28 10:13:33,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {161288#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); {161288#true} is VALID [2022-04-28 10:13:33,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {161288#true} call ULTIMATE.init(); {161288#true} is VALID [2022-04-28 10:13:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:13:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691938977] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:33,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:33,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:13:33,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428699406] [2022-04-28 10:13:33,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428699406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:33,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:33,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:13:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164550759] [2022-04-28 10:13:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:33,890 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 49 [2022-04-28 10:13:33,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:33,890 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-28 10:13:33,914 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-28 10:13:33,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:13:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:13:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:13:33,915 INFO L87 Difference]: Start difference. First operand 220 states and 283 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-28 10:13:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:37,660 INFO L93 Difference]: Finished difference Result 257 states and 320 transitions. [2022-04-28 10:13:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:13:37,660 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 49 [2022-04-28 10:13:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:37,660 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-28 10:13:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 88 transitions. [2022-04-28 10:13:37,661 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-28 10:13:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 88 transitions. [2022-04-28 10:13:37,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 88 transitions. [2022-04-28 10:13:37,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:37,734 INFO L225 Difference]: With dead ends: 257 [2022-04-28 10:13:37,734 INFO L226 Difference]: Without dead ends: 237 [2022-04-28 10:13:37,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1311, Invalid=5999, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 10:13:37,734 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:37,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:13:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-28 10:13:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2022-04-28 10:13:38,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:38,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:38,583 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:38,583 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:38,586 INFO L93 Difference]: Finished difference Result 237 states and 300 transitions. [2022-04-28 10:13:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-28 10:13:38,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:38,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:38,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 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-28 10:13:38,586 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 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-28 10:13:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:38,590 INFO L93 Difference]: Finished difference Result 237 states and 300 transitions. [2022-04-28 10:13:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2022-04-28 10:13:38,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:38,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:38,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:38,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.2962962962962963) internal successors, (280), 216 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2022-04-28 10:13:38,594 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 49 [2022-04-28 10:13:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:38,595 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2022-04-28 10:13:38,595 INFO L496 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-28 10:13:38,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 284 transitions. [2022-04-28 10:13:39,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2022-04-28 10:13:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:39,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:39,340 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:39,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:39,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,541 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1899606401, now seen corresponding path program 253 times [2022-04-28 10:13:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:39,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360543693] [2022-04-28 10:13:39,543 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:39,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1899606401, now seen corresponding path program 254 times [2022-04-28 10:13:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614289524] [2022-04-28 10:13:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {163163#(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); {163136#true} is VALID [2022-04-28 10:13:39,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-28 10:13:39,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-28 10:13:39,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:39,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {163163#(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); {163136#true} is VALID [2022-04-28 10:13:39,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-28 10:13:39,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-28 10:13:39,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-28 10:13:39,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163141#(= main_~y~0 0)} is VALID [2022-04-28 10:13:39,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {163141#(= 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; {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:39,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {163142#(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; {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:39,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {163143#(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; {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:39,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {163144#(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; {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:39,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {163145#(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; {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:39,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {163146#(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; {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:39,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {163147#(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; {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:39,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {163148#(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; {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:39,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {163149#(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; {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:39,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {163150#(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; {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:39,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {163151#(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; {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:39,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {163152#(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; {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:39,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {163153#(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; {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:39,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {163154#(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; {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:39,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {163155#(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; {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:39,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:39,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:13:39,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {163157#(and (<= main_~z~0 15) (<= 15 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; {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:39,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:39,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {163159#(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; {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:39,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {163160#(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; {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:39,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {163161#(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; {163162#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {163162#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:39,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:39,930 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-28 10:13:39,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-28 10:13:39,930 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-28 10:13:39,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-28 10:13:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:13:39,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:39,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614289524] [2022-04-28 10:13:39,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614289524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:39,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854783246] [2022-04-28 10:13:39,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:39,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:39,931 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:39,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-04-28 10:13:39,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:39,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:39,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:13:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:40,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163136#true} is VALID [2022-04-28 10:13:40,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#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); {163136#true} is VALID [2022-04-28 10:13:40,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-28 10:13:40,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-28 10:13:40,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-28 10:13:40,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163141#(= main_~y~0 0)} is VALID [2022-04-28 10:13:40,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {163141#(= 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; {163142#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:40,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {163142#(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; {163143#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:40,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {163143#(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; {163144#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:40,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {163144#(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; {163145#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:40,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {163145#(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; {163146#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:40,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {163146#(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; {163147#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:40,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {163147#(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; {163148#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:40,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {163148#(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; {163149#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {163149#(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; {163150#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:40,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {163150#(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; {163151#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:40,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {163151#(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; {163152#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:40,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {163152#(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; {163153#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:40,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {163153#(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; {163154#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:40,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {163154#(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; {163155#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:40,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {163155#(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; {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:40,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:40,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {163156#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {163157#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:13:40,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {163157#(and (<= main_~z~0 15) (<= 15 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; {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:40,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {163158#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {163159#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:40,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {163159#(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; {163160#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:40,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {163160#(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; {163161#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {163161#(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; {163248#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {163248#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:40,353 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-28 10:13:40,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-28 10:13:40,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-28 10:13:40,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-28 10:13:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:13:40,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:41,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {163137#false} assume !false; {163137#false} is VALID [2022-04-28 10:13:41,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {163137#false} assume 0 == ~cond; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {163137#false} ~cond := #in~cond; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L272 TraceCheckUtils]: 45: Hoare triple {163137#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {163137#false} assume !(~y~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {163137#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {163137#false} is VALID [2022-04-28 10:13:41,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {163372#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {163137#false} is VALID [2022-04-28 10:13:41,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {163376#(< 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; {163372#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:41,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {163380#(< 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; {163376#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:41,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {163384#(< 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; {163380#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:41,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {163388#(< 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; {163384#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:41,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {163392#(< 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; {163388#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:41,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {163392#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:41,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {163403#(< 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; {163396#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {163407#(< 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; {163403#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {163411#(< 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; {163407#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:41,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {163415#(< 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; {163411#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:41,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {163419#(< 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; {163415#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:41,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {163423#(< 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; {163419#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:41,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {163427#(< 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; {163423#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:41,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {163431#(< 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; {163427#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:41,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {163435#(< 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; {163431#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:41,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {163439#(< 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; {163435#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:41,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {163443#(< 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; {163439#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {163447#(< 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; {163443#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:41,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {163451#(< 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; {163447#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:41,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {163455#(< 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; {163451#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:41,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {163459#(< 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; {163455#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:41,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {163136#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163459#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:41,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {163136#true} call #t~ret11 := main(); {163136#true} is VALID [2022-04-28 10:13:41,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163136#true} {163136#true} #61#return; {163136#true} is VALID [2022-04-28 10:13:41,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {163136#true} assume true; {163136#true} is VALID [2022-04-28 10:13:41,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {163136#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); {163136#true} is VALID [2022-04-28 10:13:41,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {163136#true} call ULTIMATE.init(); {163136#true} is VALID [2022-04-28 10:13:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:13:41,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854783246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:41,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:41,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:13:41,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:41,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360543693] [2022-04-28 10:13:41,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360543693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:41,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:41,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:13:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695459634] [2022-04-28 10:13:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:41,140 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 49 [2022-04-28 10:13:41,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:41,140 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-28 10:13:41,162 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-28 10:13:41,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:13:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:13:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:13:41,163 INFO L87 Difference]: Start difference. First operand 221 states and 284 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-28 10:13:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:44,511 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2022-04-28 10:13:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:13:44,511 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 49 [2022-04-28 10:13:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:44,512 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-28 10:13:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-28 10:13:44,512 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-28 10:13:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-28 10:13:44,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-28 10:13:44,585 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-28 10:13:44,587 INFO L225 Difference]: With dead ends: 260 [2022-04-28 10:13:44,587 INFO L226 Difference]: Without dead ends: 239 [2022-04-28 10:13:44,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1237, Invalid=5405, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:13:44,588 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:44,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:13:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-28 10:13:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 222. [2022-04-28 10:13:45,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:45,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:45,446 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:45,446 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:45,448 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2022-04-28 10:13:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-04-28 10:13:45,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:45,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:45,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 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 239 states. [2022-04-28 10:13:45,449 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 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 239 states. [2022-04-28 10:13:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:45,451 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2022-04-28 10:13:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2022-04-28 10:13:45,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:45,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:45,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:45,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.294930875576037) internal successors, (281), 217 states have internal predecessors, (281), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 285 transitions. [2022-04-28 10:13:45,454 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 285 transitions. Word has length 49 [2022-04-28 10:13:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:45,454 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 285 transitions. [2022-04-28 10:13:45,454 INFO L496 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-28 10:13:45,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 285 transitions. [2022-04-28 10:13:46,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2022-04-28 10:13:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:46,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:46,210 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:46,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-04-28 10:13:46,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2022-04-28 10:13:46,411 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1634267409, now seen corresponding path program 255 times [2022-04-28 10:13:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:46,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946148778] [2022-04-28 10:13:46,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:46,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1634267409, now seen corresponding path program 256 times [2022-04-28 10:13:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:46,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467123275] [2022-04-28 10:13:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {165016#(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); {164990#true} is VALID [2022-04-28 10:13:46,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-28 10:13:46,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-28 10:13:46,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {165016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:46,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {165016#(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); {164990#true} is VALID [2022-04-28 10:13:46,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-28 10:13:46,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-28 10:13:46,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-28 10:13:46,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164995#(= main_~y~0 0)} is VALID [2022-04-28 10:13:46,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {164995#(= 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; {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:46,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {164996#(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; {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:46,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {164997#(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; {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:46,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {164998#(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; {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:46,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {164999#(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; {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:46,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {165000#(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; {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:46,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {165001#(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; {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:46,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {165002#(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; {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:46,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {165003#(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; {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:46,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {165004#(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; {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:46,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {165005#(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; {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:46,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {165006#(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; {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:46,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {165007#(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; {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:46,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {165008#(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; {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:46,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {165009#(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; {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:46,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {165010#(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; {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:46,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:46,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:13:46,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:13:46,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {165013#(and (<= main_~z~0 15) (<= 15 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; {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:46,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165015#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:46,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {165015#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:46,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-28 10:13:46,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-28 10:13:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:13:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467123275] [2022-04-28 10:13:46,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467123275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273998280] [2022-04-28 10:13:46,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:46,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:46,776 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:46,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-04-28 10:13:46,830 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:46,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:46,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:13:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:47,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {164990#true} is VALID [2022-04-28 10:13:47,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#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); {164990#true} is VALID [2022-04-28 10:13:47,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-28 10:13:47,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-28 10:13:47,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-28 10:13:47,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164995#(= main_~y~0 0)} is VALID [2022-04-28 10:13:47,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {164995#(= 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; {164996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:47,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {164996#(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; {164997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:47,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {164997#(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; {164998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:47,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {164998#(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; {164999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:47,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {164999#(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; {165000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:47,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {165000#(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; {165001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:47,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {165001#(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; {165002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:47,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {165002#(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; {165003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:47,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {165003#(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; {165004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:47,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {165004#(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; {165005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:47,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {165005#(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; {165006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:47,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {165006#(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; {165007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:47,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {165007#(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; {165008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:47,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {165008#(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; {165009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:47,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {165009#(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; {165010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:47,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {165010#(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; {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:47,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:47,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {165011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:13:47,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {165012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165013#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:13:47,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {165013#(and (<= main_~z~0 15) (<= 15 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; {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:13:47,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {165014#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {165098#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:47,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {165098#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:47,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-28 10:13:47,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-28 10:13:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:13:47,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {164991#false} assume !false; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {164991#false} assume 0 == ~cond; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {164991#false} ~cond := #in~cond; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L272 TraceCheckUtils]: 45: Hoare triple {164991#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {164991#false} assume !(~y~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {164991#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {164991#false} is VALID [2022-04-28 10:13:47,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {165228#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {164991#false} is VALID [2022-04-28 10:13:47,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {165232#(< 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; {165228#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:47,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {165236#(< 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; {165232#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:47,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {165240#(< 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; {165236#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:47,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {165240#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:47,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:47,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {165251#(< 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; {165244#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:47,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {165255#(< 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; {165251#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:47,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {165259#(< 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; {165255#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:47,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {165263#(< 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; {165259#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:47,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {165267#(< 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; {165263#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:47,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {165271#(< 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; {165267#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:47,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {165275#(< 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; {165271#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:47,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {165279#(< 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; {165275#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:47,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {165283#(< 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; {165279#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:47,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {165287#(< 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; {165283#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:47,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {165291#(< 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; {165287#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:47,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {165295#(< 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; {165291#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:47,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {165299#(< 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; {165295#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:47,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {165303#(< 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; {165299#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:47,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {165307#(< 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; {165303#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:47,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {165311#(< 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; {165307#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:47,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {164990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {165311#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:47,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {164990#true} call #t~ret11 := main(); {164990#true} is VALID [2022-04-28 10:13:47,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164990#true} {164990#true} #61#return; {164990#true} is VALID [2022-04-28 10:13:47,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {164990#true} assume true; {164990#true} is VALID [2022-04-28 10:13:47,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {164990#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); {164990#true} is VALID [2022-04-28 10:13:47,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {164990#true} call ULTIMATE.init(); {164990#true} is VALID [2022-04-28 10:13:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:13:47,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273998280] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:47,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:47,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:13:47,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946148778] [2022-04-28 10:13:47,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946148778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:47,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:47,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:13:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666844581] [2022-04-28 10:13:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:47,970 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 49 [2022-04-28 10:13:47,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:47,970 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-28 10:13:47,992 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-28 10:13:47,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:13:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:13:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:13:47,993 INFO L87 Difference]: Start difference. First operand 222 states and 285 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-28 10:13:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:51,348 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2022-04-28 10:13:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:13:51,348 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 49 [2022-04-28 10:13:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:51,348 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-28 10:13:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-28 10:13:51,349 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-28 10:13:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-28 10:13:51,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 89 transitions. [2022-04-28 10:13:51,433 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-28 10:13:51,435 INFO L225 Difference]: With dead ends: 263 [2022-04-28 10:13:51,435 INFO L226 Difference]: Without dead ends: 241 [2022-04-28 10:13:51,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=4223, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:13:51,436 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:51,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:13:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-28 10:13:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 223. [2022-04-28 10:13:52,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:52,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:52,348 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:52,349 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:52,351 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-04-28 10:13:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-04-28 10:13:52,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:52,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:52,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 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 241 states. [2022-04-28 10:13:52,352 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 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 241 states. [2022-04-28 10:13:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:52,354 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-04-28 10:13:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-04-28 10:13:52,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:52,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:52,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:52,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 218 states have internal predecessors, (282), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 286 transitions. [2022-04-28 10:13:52,357 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 286 transitions. Word has length 49 [2022-04-28 10:13:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:52,357 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 286 transitions. [2022-04-28 10:13:52,357 INFO L496 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-28 10:13:52,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 286 transitions. [2022-04-28 10:13:53,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 286 transitions. [2022-04-28 10:13:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:13:53,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:53,144 INFO L195 NwaCegarLoop]: trace histogram [32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:53,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:53,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:53,345 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash 564187407, now seen corresponding path program 257 times [2022-04-28 10:13:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:53,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1689474755] [2022-04-28 10:13:53,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:53,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 564187407, now seen corresponding path program 258 times [2022-04-28 10:13:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:53,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81503063] [2022-04-28 10:13:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {166880#(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); {166840#true} is VALID [2022-04-28 10:13:54,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-28 10:13:54,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-28 10:13:54,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:54,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {166880#(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); {166840#true} is VALID [2022-04-28 10:13:54,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-28 10:13:54,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-28 10:13:54,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-28 10:13:54,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166845#(= main_~y~0 0)} is VALID [2022-04-28 10:13:54,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {166845#(= 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; {166846#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:54,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {166846#(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; {166847#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:54,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {166847#(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; {166848#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:54,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {166848#(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; {166849#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:54,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {166849#(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; {166850#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:54,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {166850#(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; {166851#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:54,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {166851#(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; {166852#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:54,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {166852#(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; {166853#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:54,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {166853#(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; {166854#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:54,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {166854#(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; {166855#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:54,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {166855#(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; {166856#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:54,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {166856#(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; {166857#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:54,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {166857#(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; {166858#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:54,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {166858#(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; {166859#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:54,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {166859#(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; {166860#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:54,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {166860#(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; {166861#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:54,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {166861#(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; {166862#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:54,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {166862#(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; {166863#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:54,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {166863#(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; {166864#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:54,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {166864#(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; {166865#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:54,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {166865#(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; {166866#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:54,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {166866#(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; {166867#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:54,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {166867#(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; {166868#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:54,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {166868#(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; {166869#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:13:54,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {166869#(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; {166870#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:13:54,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {166870#(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; {166871#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:13:54,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {166871#(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; {166872#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:54,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {166872#(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; {166873#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:13:54,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {166873#(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; {166874#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:13:54,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {166874#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166875#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:13:54,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {166875#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166876#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 10:13:54,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {166876#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 10:13:54,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 10:13:54,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {166877#(and (<= main_~y~0 32) (<= 32 main_~y~0))} ~z~0 := ~y~0; {166878#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-28 10:13:54,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {166878#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {166879#(and (<= (div main_~z~0 4294967296) 0) (<= 31 main_~z~0))} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {166879#(and (<= (div main_~z~0 4294967296) 0) (<= 31 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {166841#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {166841#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-28 10:13:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:13:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:54,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81503063] [2022-04-28 10:13:54,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81503063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:54,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168162971] [2022-04-28 10:13:54,106 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:54,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:54,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:54,107 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:54,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-04-28 10:13:54,148 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:13:54,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:54,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:13:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:54,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:54,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#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); {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {166840#true} assume !(~x~0 % 4294967296 > 0); {166840#true} is VALID [2022-04-28 10:13:54,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {166840#true} ~z~0 := ~y~0; {167001#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:13:54,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {167001#(= 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; {167005#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:13:54,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {167005#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {167013#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {167013#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-28 10:13:54,425 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-28 10:13:54,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-28 10:13:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-28 10:13:54,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:54,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {166841#false} assume !false; {166841#false} is VALID [2022-04-28 10:13:54,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {166841#false} assume 0 == ~cond; {166841#false} is VALID [2022-04-28 10:13:54,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {166841#false} ~cond := #in~cond; {166841#false} is VALID [2022-04-28 10:13:54,600 INFO L272 TraceCheckUtils]: 45: Hoare triple {166841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166841#false} is VALID [2022-04-28 10:13:54,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {166841#false} assume !(~y~0 % 4294967296 > 0); {166841#false} is VALID [2022-04-28 10:13:54,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {167013#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166841#false} is VALID [2022-04-28 10:13:54,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {167013#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:54,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {167053#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {167009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:54,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {167057#(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; {167053#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:54,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {166840#true} ~z~0 := ~y~0; {167057#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:13:54,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {166840#true} assume !(~x~0 % 4294967296 > 0); {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {166840#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; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {166840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {166840#true} call #t~ret11 := main(); {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166840#true} {166840#true} #61#return; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {166840#true} assume true; {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {166840#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); {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {166840#true} call ULTIMATE.init(); {166840#true} is VALID [2022-04-28 10:13:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-04-28 10:13:54,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168162971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:54,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:54,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 6, 6] total 44 [2022-04-28 10:13:54,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:54,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1689474755] [2022-04-28 10:13:54,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1689474755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:54,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:54,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 10:13:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905005551] [2022-04-28 10:13:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 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 49 [2022-04-28 10:13:54,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:54,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:13:54,635 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-28 10:13:54,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 10:13:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 10:13:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1794, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:13:54,639 INFO L87 Difference]: Start difference. First operand 223 states and 286 transitions. Second operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:03,794 INFO L93 Difference]: Finished difference Result 355 states and 518 transitions. [2022-04-28 10:14:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 10:14:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 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 49 [2022-04-28 10:14:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 210 transitions. [2022-04-28 10:14:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 210 transitions. [2022-04-28 10:14:03,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 210 transitions. [2022-04-28 10:14:03,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:03,969 INFO L225 Difference]: With dead ends: 355 [2022-04-28 10:14:03,969 INFO L226 Difference]: Without dead ends: 347 [2022-04-28 10:14:03,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=6059, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:14:03,970 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 179 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:03,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 248 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 5363 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 10:14:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-28 10:14:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 229. [2022-04-28 10:14:04,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:04,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,867 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,867 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:04,871 INFO L93 Difference]: Finished difference Result 347 states and 422 transitions. [2022-04-28 10:14:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 422 transitions. [2022-04-28 10:14:04,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:04,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:04,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 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 347 states. [2022-04-28 10:14:04,871 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 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 347 states. [2022-04-28 10:14:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:04,875 INFO L93 Difference]: Finished difference Result 347 states and 422 transitions. [2022-04-28 10:14:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 422 transitions. [2022-04-28 10:14:04,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:04,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:04,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:04,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 224 states have internal predecessors, (290), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2022-04-28 10:14:04,878 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 49 [2022-04-28 10:14:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:04,878 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2022-04-28 10:14:04,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 37 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:04,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 294 transitions. [2022-04-28 10:14:05,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2022-04-28 10:14:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:05,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:05,642 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:05,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:05,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:05,842 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 938139085, now seen corresponding path program 259 times [2022-04-28 10:14:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047610608] [2022-04-28 10:14:05,844 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:05,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 938139085, now seen corresponding path program 260 times [2022-04-28 10:14:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:05,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565191753] [2022-04-28 10:14:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:06,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {169134#(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); {169114#true} is VALID [2022-04-28 10:14:06,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {169134#(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); {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= 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; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= 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; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= 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; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= 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; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= 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; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= 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; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= 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; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,139 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:14:06,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {169132#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {169133#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:14:06,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {169133#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169115#false} is VALID [2022-04-28 10:14:06,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-28 10:14:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:06,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565191753] [2022-04-28 10:14:06,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565191753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:06,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543050659] [2022-04-28 10:14:06,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:06,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:06,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:06,141 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:06,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-04-28 10:14:06,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:06,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:06,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 10:14:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:06,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:06,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169114#true} is VALID [2022-04-28 10:14:06,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#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); {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= 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; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= 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; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= 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; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= 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; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= 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; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= 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; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= 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; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,547 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:06,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {169280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:06,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {169280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169115#false} is VALID [2022-04-28 10:14:06,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-28 10:14:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:06,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:06,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {169115#false} assume !false; {169115#false} is VALID [2022-04-28 10:14:06,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {169280#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169115#false} is VALID [2022-04-28 10:14:06,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {169280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:06,880 INFO L272 TraceCheckUtils]: 46: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {169276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:06,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169131#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 10:14:06,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {169130#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 10:14:06,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 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; {169129#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 10:14:06,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {169128#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 10:14:06,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {169127#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {169125#(<= 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; {169126#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {169124#(<= 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; {169125#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {169123#(<= 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; {169124#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 10:14:06,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {169122#(<= 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; {169123#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {169121#(<= 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; {169122#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {169120#(<= 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; {169121#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:06,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {169119#(<= 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; {169120#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {169114#true} assume !(~x~0 % 4294967296 > 0); {169119#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {169114#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; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {169114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {169114#true} call #t~ret11 := main(); {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169114#true} {169114#true} #61#return; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {169114#true} assume true; {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {169114#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); {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {169114#true} call ULTIMATE.init(); {169114#true} is VALID [2022-04-28 10:14:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:06,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543050659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:06,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:06,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2022-04-28 10:14:06,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:06,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047610608] [2022-04-28 10:14:06,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047610608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:06,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:06,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:14:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476551957] [2022-04-28 10:14:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:06,900 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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 50 [2022-04-28 10:14:06,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:06,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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-28 10:14:06,934 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-28 10:14:06,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:14:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:14:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:14:06,935 INFO L87 Difference]: Start difference. First operand 229 states and 294 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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-28 10:14:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:14,251 INFO L93 Difference]: Finished difference Result 809 states and 1087 transitions. [2022-04-28 10:14:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:14:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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 50 [2022-04-28 10:14:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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-28 10:14:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 10:14:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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-28 10:14:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 10:14:14,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-28 10:14:14,326 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-28 10:14:14,348 INFO L225 Difference]: With dead ends: 809 [2022-04-28 10:14:14,348 INFO L226 Difference]: Without dead ends: 791 [2022-04-28 10:14:14,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:14:14,349 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:14,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 124 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:14:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-04-28 10:14:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 233. [2022-04-28 10:14:15,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:15,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,274 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,274 INFO L87 Difference]: Start difference. First operand 791 states. Second operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,292 INFO L93 Difference]: Finished difference Result 791 states and 1068 transitions. [2022-04-28 10:14:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1068 transitions. [2022-04-28 10:14:15,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 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 791 states. [2022-04-28 10:14:15,293 INFO L87 Difference]: Start difference. First operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 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 791 states. [2022-04-28 10:14:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,310 INFO L93 Difference]: Finished difference Result 791 states and 1068 transitions. [2022-04-28 10:14:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1068 transitions. [2022-04-28 10:14:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:15,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:15,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:15,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 228 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2022-04-28 10:14:15,314 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 50 [2022-04-28 10:14:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:15,314 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2022-04-28 10:14:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 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-28 10:14:15,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 300 transitions. [2022-04-28 10:14:16,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2022-04-28 10:14:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:16,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:16,166 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:16,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2022-04-28 10:14:16,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-04-28 10:14:16,367 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:16,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 618158975, now seen corresponding path program 261 times [2022-04-28 10:14:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:16,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1850532446] [2022-04-28 10:14:16,369 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:16,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 618158975, now seen corresponding path program 262 times [2022-04-28 10:14:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:16,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516743426] [2022-04-28 10:14:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {173162#(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); {173132#true} is VALID [2022-04-28 10:14:16,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-28 10:14:16,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-28 10:14:16,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:16,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {173162#(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); {173132#true} is VALID [2022-04-28 10:14:16,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-28 10:14:16,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-28 10:14:16,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-28 10:14:16,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173137#(= main_~y~0 0)} is VALID [2022-04-28 10:14:16,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {173137#(= 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; {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:16,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {173138#(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; {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {173139#(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; {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:16,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {173140#(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; {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:16,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {173141#(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; {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:16,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {173142#(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; {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:16,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {173143#(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; {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:16,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {173144#(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; {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:16,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {173145#(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; {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:16,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {173146#(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; {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:16,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {173147#(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; {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:16,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {173148#(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; {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:16,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {173149#(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; {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:16,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:16,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {173151#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:16,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {173151#(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; {173152#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:16,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {173152#(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; {173153#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:16,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {173153#(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; {173154#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:16,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {173154#(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; {173155#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:16,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {173155#(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; {173156#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:16,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {173156#(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; {173157#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:16,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {173157#(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; {173158#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:16,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {173158#(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; {173159#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:16,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {173159#(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; {173160#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:16,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {173160#(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; {173161#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:16,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {173161#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-28 10:14:16,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-28 10:14:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:14:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:16,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516743426] [2022-04-28 10:14:16,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516743426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:16,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122097000] [2022-04-28 10:14:16,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:16,825 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:16,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-04-28 10:14:16,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:16,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:16,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 10:14:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:16,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:17,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173132#true} is VALID [2022-04-28 10:14:17,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#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); {173132#true} is VALID [2022-04-28 10:14:17,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-28 10:14:17,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-28 10:14:17,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-28 10:14:17,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173137#(= main_~y~0 0)} is VALID [2022-04-28 10:14:17,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {173137#(= 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; {173138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:17,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {173138#(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; {173139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:17,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {173139#(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; {173140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:17,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {173140#(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; {173141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:17,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {173141#(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; {173142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:17,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {173142#(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; {173143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:17,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {173143#(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; {173144#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:17,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {173144#(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; {173145#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:17,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {173145#(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; {173146#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:17,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {173146#(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; {173147#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:17,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {173147#(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; {173148#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:17,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {173148#(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; {173149#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:17,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {173149#(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; {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {173150#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {173226#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {173226#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 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; {173230#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:14:17,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {173230#(and (<= main_~y~0 13) (<= 13 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; {173234#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {173234#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 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; {173238#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {173238#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 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; {173242#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:14:17,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {173242#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173246#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {173246#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 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; {173250#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {173250#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 13 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; {173254#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {173254#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 13 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; {173258#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {173258#(and (<= main_~y~0 13) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 13 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; {173262#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:17,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {173262#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 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; {173266#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {173266#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} assume !(~z~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-28 10:14:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:14:17,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:18,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {173133#false} assume !false; {173133#false} is VALID [2022-04-28 10:14:18,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {173133#false} assume 0 == ~cond; {173133#false} is VALID [2022-04-28 10:14:18,427 INFO L290 TraceCheckUtils]: 47: Hoare triple {173133#false} ~cond := #in~cond; {173133#false} is VALID [2022-04-28 10:14:18,427 INFO L272 TraceCheckUtils]: 46: Hoare triple {173133#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {173133#false} is VALID [2022-04-28 10:14:18,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {173133#false} assume !(~y~0 % 4294967296 > 0); {173133#false} is VALID [2022-04-28 10:14:18,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:18,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {173133#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:18,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {173345#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173133#false} is VALID [2022-04-28 10:14:18,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {173349#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173345#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:18,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {173353#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173349#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:18,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {173357#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173353#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:18,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {173361#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173357#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:14:18,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {173365#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173361#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:18,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {173369#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173365#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:18,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {173373#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173369#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:18,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {173377#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173373#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:14:18,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {173381#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173377#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:18,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {173385#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {173381#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:14:18,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {173389#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {173385#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:14:18,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {173393#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {173389#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:14:18,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {173397#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173393#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:18,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {173401#(or (not (< 0 (mod (+ main_~y~0 4294967286) 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; {173397#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:14:18,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {173405#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173401#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:14:18,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {173409#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173405#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:14:18,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {173413#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {173409#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))))} is VALID [2022-04-28 10:14:18,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {173417#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {173413#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:18,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {173421#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {173417#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:14:18,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {173425#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 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; {173421#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:18,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {173429#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {173425#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:14:18,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {173132#true} ~z~0 := ~y~0; {173429#(or (not (< 0 (mod (+ main_~y~0 4294967286) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:14:18,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {173132#true} assume !(~x~0 % 4294967296 > 0); {173132#true} is VALID [2022-04-28 10:14:18,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {173132#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; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {173132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {173132#true} call #t~ret11 := main(); {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173132#true} {173132#true} #61#return; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {173132#true} assume true; {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {173132#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); {173132#true} is VALID [2022-04-28 10:14:18,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {173132#true} call ULTIMATE.init(); {173132#true} is VALID [2022-04-28 10:14:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-28 10:14:18,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122097000] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:18,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:18,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 24] total 61 [2022-04-28 10:14:18,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:18,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1850532446] [2022-04-28 10:14:18,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1850532446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:18,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:18,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:14:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113423247] [2022-04-28 10:14:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:18,445 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 50 [2022-04-28 10:14:18,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:18,446 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-28 10:14:18,470 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-28 10:14:18,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:14:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:14:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3247, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:14:18,471 INFO L87 Difference]: Start difference. First operand 233 states and 300 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-28 10:14:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,477 INFO L93 Difference]: Finished difference Result 268 states and 335 transitions. [2022-04-28 10:14:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:14:22,477 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 50 [2022-04-28 10:14:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,477 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-28 10:14:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 82 transitions. [2022-04-28 10:14:22,478 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-28 10:14:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 82 transitions. [2022-04-28 10:14:22,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 82 transitions. [2022-04-28 10:14:22,543 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-28 10:14:22,545 INFO L225 Difference]: With dead ends: 268 [2022-04-28 10:14:22,545 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 10:14:22,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=866, Invalid=8254, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 10:14:22,546 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:22,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 135 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:14:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 10:14:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2022-04-28 10:14:23,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:23,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:23,465 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:23,465 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,468 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-04-28 10:14:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-04-28 10:14:23,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 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 249 states. [2022-04-28 10:14:23,468 INFO L87 Difference]: Start difference. First operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 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 249 states. [2022-04-28 10:14:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,471 INFO L93 Difference]: Finished difference Result 249 states and 316 transitions. [2022-04-28 10:14:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 316 transitions. [2022-04-28 10:14:23,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:23,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.296943231441048) internal successors, (297), 229 states have internal predecessors, (297), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 301 transitions. [2022-04-28 10:14:23,474 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 301 transitions. Word has length 50 [2022-04-28 10:14:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:23,474 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 301 transitions. [2022-04-28 10:14:23,474 INFO L496 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-28 10:14:23,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 301 transitions. [2022-04-28 10:14:24,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 301 transitions. [2022-04-28 10:14:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:24,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:24,315 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:24,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2022-04-28 10:14:24,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-04-28 10:14:24,516 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2033330125, now seen corresponding path program 263 times [2022-04-28 10:14:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:24,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566662190] [2022-04-28 10:14:24,518 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:24,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2033330125, now seen corresponding path program 264 times [2022-04-28 10:14:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934144816] [2022-04-28 10:14:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:24,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:24,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {175096#(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); {175067#true} is VALID [2022-04-28 10:14:24,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-28 10:14:24,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-28 10:14:24,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175096#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:24,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {175096#(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); {175067#true} is VALID [2022-04-28 10:14:24,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-28 10:14:24,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-28 10:14:24,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-28 10:14:24,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175072#(= main_~y~0 0)} is VALID [2022-04-28 10:14:24,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {175072#(= 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; {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:24,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {175073#(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; {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:24,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {175074#(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; {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:24,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {175075#(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; {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:24,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {175076#(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; {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:24,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {175077#(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; {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:24,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {175078#(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; {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:24,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {175079#(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; {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:24,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {175080#(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; {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:24,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {175081#(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; {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:24,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {175082#(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; {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:24,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {175083#(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; {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:24,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {175084#(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; {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:24,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {175085#(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; {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:24,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:24,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:24,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:24,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {175088#(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; {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:24,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {175089#(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; {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:24,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {175090#(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; {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:24,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {175091#(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; {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:24,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {175092#(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; {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:24,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {175093#(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; {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:24,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {175094#(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; {175095#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:24,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {175095#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:24,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:24,959 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-28 10:14:24,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-28 10:14:24,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-28 10:14:24,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-28 10:14:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:14:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:24,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934144816] [2022-04-28 10:14:24,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934144816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:24,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919605757] [2022-04-28 10:14:24,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:24,964 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:24,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-04-28 10:14:25,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:14:25,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:25,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:14:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:25,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175067#true} is VALID [2022-04-28 10:14:25,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#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); {175067#true} is VALID [2022-04-28 10:14:25,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-28 10:14:25,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-28 10:14:25,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-28 10:14:25,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175072#(= main_~y~0 0)} is VALID [2022-04-28 10:14:25,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {175072#(= 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; {175073#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:25,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {175073#(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; {175074#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:25,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {175074#(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; {175075#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:25,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {175075#(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; {175076#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:25,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {175076#(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; {175077#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:25,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {175077#(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; {175078#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:25,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {175078#(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; {175079#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:25,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {175079#(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; {175080#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:25,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {175080#(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; {175081#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:25,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {175081#(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; {175082#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:25,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {175082#(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; {175083#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:25,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {175083#(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; {175084#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:25,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {175084#(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; {175085#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:25,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {175085#(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; {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:25,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:25,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {175086#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:25,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {175087#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {175088#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:25,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {175088#(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; {175089#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:25,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {175089#(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; {175090#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:25,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {175090#(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; {175091#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:25,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {175091#(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; {175092#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:25,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {175092#(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; {175093#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:25,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {175093#(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; {175094#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {175094#(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; {175187#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {175187#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-28 10:14:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:14:25,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {175068#false} assume !false; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {175068#false} assume 0 == ~cond; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {175068#false} ~cond := #in~cond; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L272 TraceCheckUtils]: 46: Hoare triple {175068#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {175068#false} assume !(~y~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {175068#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {175068#false} is VALID [2022-04-28 10:14:26,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {175305#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {175068#false} is VALID [2022-04-28 10:14:26,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {175309#(< 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; {175305#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:26,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {175313#(< 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; {175309#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:26,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {175317#(< 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; {175313#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:26,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {175321#(< 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; {175317#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:26,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {175325#(< 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; {175321#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:26,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {175329#(< 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; {175325#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:26,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {175333#(< 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; {175329#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:26,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {175337#(< 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; {175333#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:14:26,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {175337#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:26,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {175348#(< 0 (mod (+ main_~y~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; {175341#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {175352#(< 0 (mod (+ 4294967290 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; {175348#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:14:26,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {175356#(< 0 (mod (+ 4294967291 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; {175352#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {175360#(< 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; {175356#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {175364#(< 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; {175360#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {175368#(< 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; {175364#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:26,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {175372#(< 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; {175368#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:26,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {175376#(< 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; {175372#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:26,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {175380#(< 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; {175376#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:26,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {175384#(< 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; {175380#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:26,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {175388#(< 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; {175384#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:26,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {175392#(< 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; {175388#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:26,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {175396#(< 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; {175392#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:26,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {175400#(< 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; {175396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:26,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {175067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {175400#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:26,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {175067#true} call #t~ret11 := main(); {175067#true} is VALID [2022-04-28 10:14:26,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175067#true} {175067#true} #61#return; {175067#true} is VALID [2022-04-28 10:14:26,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {175067#true} assume true; {175067#true} is VALID [2022-04-28 10:14:26,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {175067#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); {175067#true} is VALID [2022-04-28 10:14:26,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {175067#true} call ULTIMATE.init(); {175067#true} is VALID [2022-04-28 10:14:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:14:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919605757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:26,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:26,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:14:26,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:26,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566662190] [2022-04-28 10:14:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566662190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:26,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:26,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:14:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822013080] [2022-04-28 10:14:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:26,691 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 50 [2022-04-28 10:14:26,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:26,691 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-28 10:14:26,716 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-28 10:14:26,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:14:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:14:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=2242, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:14:26,716 INFO L87 Difference]: Start difference. First operand 234 states and 301 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-28 10:14:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:30,377 INFO L93 Difference]: Finished difference Result 271 states and 338 transitions. [2022-04-28 10:14:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 10:14:30,377 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 50 [2022-04-28 10:14:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:30,377 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-28 10:14:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 91 transitions. [2022-04-28 10:14:30,378 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-28 10:14:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 91 transitions. [2022-04-28 10:14:30,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 91 transitions. [2022-04-28 10:14:30,450 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-28 10:14:30,452 INFO L225 Difference]: With dead ends: 271 [2022-04-28 10:14:30,452 INFO L226 Difference]: Without dead ends: 251 [2022-04-28 10:14:30,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1433, Invalid=6757, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:14:30,453 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:30,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 102 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-28 10:14:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2022-04-28 10:14:31,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:31,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:31,397 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:31,397 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:31,400 INFO L93 Difference]: Finished difference Result 251 states and 318 transitions. [2022-04-28 10:14:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 318 transitions. [2022-04-28 10:14:31,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:31,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 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 251 states. [2022-04-28 10:14:31,400 INFO L87 Difference]: Start difference. First operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 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 251 states. [2022-04-28 10:14:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:31,403 INFO L93 Difference]: Finished difference Result 251 states and 318 transitions. [2022-04-28 10:14:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 318 transitions. [2022-04-28 10:14:31,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:31,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:31,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:31,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.2956521739130435) internal successors, (298), 230 states have internal predecessors, (298), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 302 transitions. [2022-04-28 10:14:31,406 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 302 transitions. Word has length 50 [2022-04-28 10:14:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 302 transitions. [2022-04-28 10:14:31,406 INFO L496 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-28 10:14:31,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 302 transitions. [2022-04-28 10:14:32,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 302 transitions. [2022-04-28 10:14:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:32,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:32,285 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:32,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:32,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-04-28 10:14:32,485 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1252468353, now seen corresponding path program 265 times [2022-04-28 10:14:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:32,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166701133] [2022-04-28 10:14:32,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:32,488 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1252468353, now seen corresponding path program 266 times [2022-04-28 10:14:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:32,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265919188] [2022-04-28 10:14:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:32,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:32,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {177041#(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); {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:32,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {177041#(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); {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-28 10:14:32,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177018#(= main_~y~0 0)} is VALID [2022-04-28 10:14:32,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {177018#(= 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; {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:32,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {177019#(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; {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:32,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {177020#(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; {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:32,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {177021#(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; {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:32,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {177022#(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; {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:32,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {177023#(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; {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:32,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {177024#(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; {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:32,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {177025#(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; {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:32,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {177026#(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; {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:32,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {177027#(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; {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:32,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {177028#(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; {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:32,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {177029#(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; {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:32,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {177030#(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; {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:32,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {177031#(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; {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:32,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {177032#(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; {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:32,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:32,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:32,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {177034#(and (<= main_~z~0 15) (<= 15 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; {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:32,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:32,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {177036#(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; {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:32,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {177037#(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; {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:32,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {177038#(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; {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {177039#(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; {177040#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {177040#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-28 10:14:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:14:32,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265919188] [2022-04-28 10:14:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265919188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:32,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699795940] [2022-04-28 10:14:32,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:32,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:32,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:32,907 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-04-28 10:14:32,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:32,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:32,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:14:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:32,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:33,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177013#true} is VALID [2022-04-28 10:14:33,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#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); {177013#true} is VALID [2022-04-28 10:14:33,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-28 10:14:33,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-28 10:14:33,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-28 10:14:33,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177018#(= main_~y~0 0)} is VALID [2022-04-28 10:14:33,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {177018#(= 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; {177019#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:33,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {177019#(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; {177020#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:33,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {177020#(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; {177021#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:33,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {177021#(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; {177022#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:33,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {177022#(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; {177023#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:33,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {177023#(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; {177024#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:33,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {177024#(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; {177025#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:33,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {177025#(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; {177026#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:33,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {177026#(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; {177027#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:33,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {177027#(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; {177028#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:33,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {177028#(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; {177029#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:33,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {177029#(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; {177030#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:33,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {177030#(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; {177031#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:33,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {177031#(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; {177032#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:33,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {177032#(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; {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:33,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:33,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {177033#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {177034#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:33,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {177034#(and (<= main_~z~0 15) (<= 15 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; {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:33,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {177035#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177036#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:33,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {177036#(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; {177037#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:33,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {177037#(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; {177038#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:33,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {177038#(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; {177039#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:33,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {177039#(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; {177129#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:33,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {177129#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:33,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-28 10:14:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:14:33,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {177014#false} assume !false; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {177014#false} assume 0 == ~cond; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {177014#false} ~cond := #in~cond; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L272 TraceCheckUtils]: 46: Hoare triple {177014#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {177014#false} assume !(~y~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {177014#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {177014#false} is VALID [2022-04-28 10:14:34,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {177253#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {177014#false} is VALID [2022-04-28 10:14:34,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {177257#(< 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; {177253#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:34,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {177261#(< 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; {177257#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:34,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {177265#(< 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; {177261#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:34,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {177269#(< 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; {177265#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:34,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {177273#(< 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; {177269#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:34,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {177277#(< 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; {177273#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:34,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {177277#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:34,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {177288#(< 0 (mod (+ 4294967291 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; {177281#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {177292#(< 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; {177288#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {177296#(< 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; {177292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {177300#(< 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; {177296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:34,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {177304#(< 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; {177300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:34,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {177308#(< 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; {177304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:34,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {177312#(< 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; {177308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:34,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {177316#(< 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; {177312#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:34,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {177320#(< 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; {177316#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:34,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {177324#(< 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; {177320#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:34,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {177328#(< 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; {177324#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:34,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {177332#(< 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; {177328#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {177336#(< 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; {177332#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:34,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {177340#(< 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; {177336#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:34,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {177344#(< 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; {177340#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:34,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {177013#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177344#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:34,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {177013#true} call #t~ret11 := main(); {177013#true} is VALID [2022-04-28 10:14:34,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177013#true} {177013#true} #61#return; {177013#true} is VALID [2022-04-28 10:14:34,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {177013#true} assume true; {177013#true} is VALID [2022-04-28 10:14:34,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {177013#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); {177013#true} is VALID [2022-04-28 10:14:34,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {177013#true} call ULTIMATE.init(); {177013#true} is VALID [2022-04-28 10:14:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:14:34,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699795940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:34,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:34,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:14:34,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166701133] [2022-04-28 10:14:34,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166701133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:34,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:34,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:14:34,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647500980] [2022-04-28 10:14:34,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:34,173 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 50 [2022-04-28 10:14:34,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:34,173 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-28 10:14:34,196 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-28 10:14:34,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:14:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:14:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:34,196 INFO L87 Difference]: Start difference. First operand 235 states and 302 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-28 10:14:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,236 INFO L93 Difference]: Finished difference Result 274 states and 341 transitions. [2022-04-28 10:14:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 10:14:38,236 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 50 [2022-04-28 10:14:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:38,236 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-28 10:14:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 95 transitions. [2022-04-28 10:14:38,237 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-28 10:14:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 95 transitions. [2022-04-28 10:14:38,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 95 transitions. [2022-04-28 10:14:38,314 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-28 10:14:38,316 INFO L225 Difference]: With dead ends: 274 [2022-04-28 10:14:38,316 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 10:14:38,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1396, Invalid=6260, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:14:38,317 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:38,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:14:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 10:14:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2022-04-28 10:14:39,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:39,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,266 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,266 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:39,269 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-28 10:14:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-28 10:14:39,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:39,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:39,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 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-28 10:14:39,270 INFO L87 Difference]: Start difference. First operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 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-28 10:14:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:39,274 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2022-04-28 10:14:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2022-04-28 10:14:39,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:39,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:39,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:39,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 231 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 303 transitions. [2022-04-28 10:14:39,281 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 303 transitions. Word has length 50 [2022-04-28 10:14:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:39,281 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 303 transitions. [2022-04-28 10:14:39,281 INFO L496 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-28 10:14:39,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 236 states and 303 transitions. [2022-04-28 10:14:40,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 303 transitions. [2022-04-28 10:14:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:40,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:40,132 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:40,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2022-04-28 10:14:40,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:40,335 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -168697395, now seen corresponding path program 267 times [2022-04-28 10:14:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:40,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881818995] [2022-04-28 10:14:40,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:40,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -168697395, now seen corresponding path program 268 times [2022-04-28 10:14:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744242008] [2022-04-28 10:14:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {178994#(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); {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:40,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {178994#(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); {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-28 10:14:40,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-28 10:14:40,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {178972#(= main_~y~0 0)} is VALID [2022-04-28 10:14:40,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {178972#(= 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; {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:40,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {178973#(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; {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:40,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {178974#(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; {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:40,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {178975#(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; {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:40,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {178976#(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; {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:40,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {178977#(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; {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:40,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {178978#(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; {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:40,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {178979#(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; {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:40,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {178980#(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; {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:40,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {178981#(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; {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:40,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {178982#(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; {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:40,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {178983#(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; {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:40,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {178984#(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; {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:40,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {178985#(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; {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:40,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {178986#(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; {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:40,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {178987#(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; {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:40,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:40,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:14:40,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:40,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {178990#(and (<= main_~z~0 15) (<= 15 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; {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:40,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:40,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {178992#(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; {178993#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {178993#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-28 10:14:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:14:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:40,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744242008] [2022-04-28 10:14:40,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744242008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:40,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312255276] [2022-04-28 10:14:40,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:40,757 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-04-28 10:14:40,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:40,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:40,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:14:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:40,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:41,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178967#true} is VALID [2022-04-28 10:14:41,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#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); {178967#true} is VALID [2022-04-28 10:14:41,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-28 10:14:41,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-28 10:14:41,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-28 10:14:41,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {178972#(= main_~y~0 0)} is VALID [2022-04-28 10:14:41,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {178972#(= 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; {178973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:41,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {178973#(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; {178974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:41,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {178974#(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; {178975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:41,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {178975#(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; {178976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:41,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {178976#(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; {178977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:41,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {178977#(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; {178978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:41,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {178978#(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; {178979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:41,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {178979#(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; {178980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:41,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {178980#(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; {178981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:41,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {178981#(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; {178982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:41,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {178982#(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; {178983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:41,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {178983#(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; {178984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:41,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {178984#(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; {178985#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:41,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {178985#(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; {178986#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:41,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {178986#(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; {178987#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:41,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {178987#(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; {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:41,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:41,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {178988#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:14:41,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {178989#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178990#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:41,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {178990#(and (<= main_~z~0 15) (<= 15 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; {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:14:41,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {178991#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {178992#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:41,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {178992#(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; {179079#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {179079#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-28 10:14:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:14:41,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:41,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {178968#false} assume !false; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {178968#false} assume 0 == ~cond; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {178968#false} ~cond := #in~cond; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L272 TraceCheckUtils]: 46: Hoare triple {178968#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {178968#false} assume !(~y~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {178968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {178968#false} is VALID [2022-04-28 10:14:41,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {179209#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {178968#false} is VALID [2022-04-28 10:14:41,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {179213#(< 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; {179209#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:41,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {179217#(< 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; {179213#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:41,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {179221#(< 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; {179217#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:41,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {179225#(< 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; {179221#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:41,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {179225#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:41,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:41,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {179236#(< 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; {179229#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:41,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {179240#(< 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; {179236#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:41,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {179244#(< 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; {179240#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:41,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {179248#(< 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; {179244#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:41,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {179252#(< 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; {179248#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:41,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {179256#(< 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; {179252#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:41,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {179260#(< 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; {179256#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:41,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {179264#(< 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; {179260#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:41,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {179268#(< 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; {179264#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:41,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {179272#(< 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; {179268#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:41,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {179276#(< 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; {179272#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:41,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {179280#(< 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; {179276#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:41,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {179284#(< 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; {179280#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:41,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {179288#(< 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; {179284#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:41,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {179292#(< 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; {179288#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:41,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {179296#(< 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; {179292#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:41,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {178967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {179296#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:41,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {178967#true} call #t~ret11 := main(); {178967#true} is VALID [2022-04-28 10:14:41,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178967#true} {178967#true} #61#return; {178967#true} is VALID [2022-04-28 10:14:41,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {178967#true} assume true; {178967#true} is VALID [2022-04-28 10:14:41,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {178967#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); {178967#true} is VALID [2022-04-28 10:14:41,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {178967#true} call ULTIMATE.init(); {178967#true} is VALID [2022-04-28 10:14:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 10:14:41,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312255276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:41,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:41,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:14:41,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:41,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881818995] [2022-04-28 10:14:41,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881818995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:41,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:41,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:14:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768104653] [2022-04-28 10:14:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:41,959 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 50 [2022-04-28 10:14:41,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:41,959 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-28 10:14:41,980 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-28 10:14:41,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:14:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:14:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:14:41,981 INFO L87 Difference]: Start difference. First operand 236 states and 303 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-28 10:14:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:45,716 INFO L93 Difference]: Finished difference Result 277 states and 344 transitions. [2022-04-28 10:14:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:14:45,716 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 50 [2022-04-28 10:14:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:45,716 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-28 10:14:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-28 10:14:45,717 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-28 10:14:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 94 transitions. [2022-04-28 10:14:45,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 94 transitions. [2022-04-28 10:14:45,792 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-28 10:14:45,795 INFO L225 Difference]: With dead ends: 277 [2022-04-28 10:14:45,795 INFO L226 Difference]: Without dead ends: 255 [2022-04-28 10:14:45,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1204, Invalid=5116, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:14:45,796 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:45,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:14:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-04-28 10:14:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2022-04-28 10:14:46,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:46,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:46,750 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:46,750 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,753 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2022-04-28 10:14:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2022-04-28 10:14:46,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:46,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:46,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 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 255 states. [2022-04-28 10:14:46,753 INFO L87 Difference]: Start difference. First operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 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 255 states. [2022-04-28 10:14:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,756 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2022-04-28 10:14:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2022-04-28 10:14:46,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:46,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:46,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:46,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.293103448275862) internal successors, (300), 232 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 304 transitions. [2022-04-28 10:14:46,759 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 304 transitions. Word has length 50 [2022-04-28 10:14:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:46,759 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 304 transitions. [2022-04-28 10:14:46,759 INFO L496 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-28 10:14:46,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 237 states and 304 transitions. [2022-04-28 10:14:47,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 304 transitions. [2022-04-28 10:14:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:47,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:47,743 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:47,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-04-28 10:14:47,943 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1351555201, now seen corresponding path program 269 times [2022-04-28 10:14:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:47,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994537262] [2022-04-28 10:14:47,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:47,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1351555201, now seen corresponding path program 270 times [2022-04-28 10:14:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694997891] [2022-04-28 10:14:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:48,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {180945#(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); {180919#true} is VALID [2022-04-28 10:14:48,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-28 10:14:48,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-28 10:14:48,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:48,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {180945#(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); {180919#true} is VALID [2022-04-28 10:14:48,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-28 10:14:48,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-28 10:14:48,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-28 10:14:48,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180924#(= main_~y~0 0)} is VALID [2022-04-28 10:14:48,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {180924#(= 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; {180925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:48,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {180925#(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; {180926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:48,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {180926#(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; {180927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:48,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {180927#(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; {180928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:48,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {180928#(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; {180929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:48,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {180929#(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; {180930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:48,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {180930#(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; {180931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:48,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {180931#(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; {180932#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:48,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {180932#(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; {180933#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:48,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {180933#(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; {180934#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:48,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {180934#(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; {180935#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:48,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {180935#(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; {180936#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:48,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {180936#(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; {180937#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:48,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {180937#(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; {180938#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:48,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {180938#(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; {180939#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:48,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {180939#(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; {180940#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:48,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {180940#(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; {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:48,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:48,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {180941#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {180942#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:14:48,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {180942#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {180943#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:14:48,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {180943#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {180944#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:14:48,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {180944#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-28 10:14:48,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-28 10:14:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 10:14:48,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:48,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694997891] [2022-04-28 10:14:48,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694997891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:48,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910409815] [2022-04-28 10:14:48,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:48,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:48,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:48,312 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:48,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-04-28 10:14:48,577 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:14:48,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:48,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:14:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:48,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:48,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#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); {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {180919#true} assume !(~x~0 % 4294967296 > 0); {180919#true} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {180919#true} ~z~0 := ~y~0; {181021#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:48,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {181021#(= 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; {181025#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:14:48,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {181025#(= 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; {181029#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 10:14:48,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {181029#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:48,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181041#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {181041#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-28 10:14:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-04-28 10:14:48,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:49,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {180920#false} assume !false; {180920#false} is VALID [2022-04-28 10:14:49,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {180920#false} assume 0 == ~cond; {180920#false} is VALID [2022-04-28 10:14:49,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {180920#false} ~cond := #in~cond; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L272 TraceCheckUtils]: 46: Hoare triple {180920#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {180920#false} assume !(~y~0 % 4294967296 > 0); {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {180920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {181041#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {180920#false} is VALID [2022-04-28 10:14:49,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181041#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:49,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {181037#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:49,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {181168#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {181033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:49,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {181172#(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; {181168#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:14:49,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {181176#(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; {181172#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {180919#true} ~z~0 := ~y~0; {181176#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {180919#true} assume !(~x~0 % 4294967296 > 0); {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {180919#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; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {180919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {180919#true} call #t~ret11 := main(); {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180919#true} {180919#true} #61#return; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {180919#true} assume true; {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {180919#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); {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {180919#true} call ULTIMATE.init(); {180919#true} is VALID [2022-04-28 10:14:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-04-28 10:14:49,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910409815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:49,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:49,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8, 8] total 33 [2022-04-28 10:14:49,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:49,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994537262] [2022-04-28 10:14:49,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994537262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:49,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:49,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:14:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895041749] [2022-04-28 10:14:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:49,021 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 50 [2022-04-28 10:14:49,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:49,021 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-28 10:14:49,042 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-28 10:14:49,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:14:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:49,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:14:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:14:49,043 INFO L87 Difference]: Start difference. First operand 237 states and 304 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-28 10:14:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:52,371 INFO L93 Difference]: Finished difference Result 280 states and 347 transitions. [2022-04-28 10:14:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:14:52,371 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 50 [2022-04-28 10:14:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:52,371 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-28 10:14:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-28 10:14:52,372 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-28 10:14:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-28 10:14:52,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 91 transitions. [2022-04-28 10:14:52,445 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-28 10:14:52,448 INFO L225 Difference]: With dead ends: 280 [2022-04-28 10:14:52,448 INFO L226 Difference]: Without dead ends: 257 [2022-04-28 10:14:52,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=2965, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:14:52,448 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:52,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 124 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:14:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-28 10:14:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 238. [2022-04-28 10:14:53,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:53,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:53,416 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:53,416 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:53,419 INFO L93 Difference]: Finished difference Result 257 states and 324 transitions. [2022-04-28 10:14:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2022-04-28 10:14:53,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:53,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:53,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 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 257 states. [2022-04-28 10:14:53,419 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 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 257 states. [2022-04-28 10:14:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:53,422 INFO L93 Difference]: Finished difference Result 257 states and 324 transitions. [2022-04-28 10:14:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2022-04-28 10:14:53,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:53,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:53,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:53,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 233 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-04-28 10:14:53,425 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 50 [2022-04-28 10:14:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:53,425 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-04-28 10:14:53,425 INFO L496 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-28 10:14:53,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 305 transitions. [2022-04-28 10:14:54,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-04-28 10:14:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 10:14:54,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:54,353 INFO L195 NwaCegarLoop]: trace histogram [33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:54,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:54,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-04-28 10:14:54,553 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -233610738, now seen corresponding path program 271 times [2022-04-28 10:14:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:54,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361114224] [2022-04-28 10:14:54,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:54,555 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -233610738, now seen corresponding path program 272 times [2022-04-28 10:14:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:54,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484347680] [2022-04-28 10:14:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:55,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {182893#(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); {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:55,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {182893#(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); {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-28 10:14:55,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-28 10:14:55,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {182857#(= main_~y~0 0)} is VALID [2022-04-28 10:14:55,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {182857#(= 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; {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:55,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {182858#(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; {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:55,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {182859#(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; {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:55,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {182860#(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; {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:55,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {182861#(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; {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:55,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {182862#(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; {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:55,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {182863#(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; {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:55,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {182864#(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; {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:55,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {182865#(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; {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:55,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {182866#(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; {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:55,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {182867#(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; {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:55,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {182868#(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; {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:55,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {182869#(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; {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:55,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {182870#(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; {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:55,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {182871#(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; {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:55,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {182872#(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; {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:55,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {182873#(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; {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:55,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {182874#(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; {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:55,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {182875#(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; {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:55,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {182876#(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; {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:55,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {182877#(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; {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:55,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {182878#(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; {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:55,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {182879#(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; {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:55,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {182880#(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; {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:55,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {182881#(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; {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:14:55,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {182882#(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; {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:14:55,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {182883#(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; {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:14:55,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {182884#(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; {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:55,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {182885#(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; {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:14:55,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:14:55,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 10:14:55,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 10:14:55,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 10:14:55,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !(~x~0 % 4294967296 > 0); {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 10:14:55,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} ~z~0 := ~y~0; {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-28 10:14:55,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {182892#(and (<= 32 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {182892#(and (<= 32 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-28 10:14:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:14:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484347680] [2022-04-28 10:14:55,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484347680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380072239] [2022-04-28 10:14:55,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:55,330 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:55,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-04-28 10:14:55,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:55,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:55,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 10:14:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:55,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:55,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182852#true} is VALID [2022-04-28 10:14:55,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#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); {182852#true} is VALID [2022-04-28 10:14:55,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-28 10:14:55,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-28 10:14:55,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-28 10:14:55,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {182857#(= main_~y~0 0)} is VALID [2022-04-28 10:14:55,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {182857#(= 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; {182858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:55,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {182858#(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; {182859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:55,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {182859#(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; {182860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:55,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {182860#(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; {182861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:55,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {182861#(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; {182862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:55,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {182862#(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; {182863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:55,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {182863#(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; {182864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:55,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {182864#(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; {182865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:55,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {182865#(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; {182866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:55,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {182866#(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; {182867#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:55,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {182867#(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; {182868#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:55,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {182868#(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; {182869#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:55,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {182869#(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; {182870#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:55,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {182870#(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; {182871#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:55,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {182871#(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; {182872#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:55,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {182872#(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; {182873#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:55,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {182873#(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; {182874#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:55,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {182874#(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; {182875#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:55,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {182875#(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; {182876#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:55,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {182876#(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; {182877#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:55,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {182877#(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; {182878#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:55,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {182878#(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; {182879#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:55,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {182879#(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; {182880#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:55,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {182880#(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; {182881#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:55,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {182881#(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; {182882#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:14:55,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {182882#(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; {182883#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:14:55,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {182883#(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; {182884#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:14:55,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {182884#(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; {182885#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:55,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {182885#(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; {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:14:55,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {182886#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} is VALID [2022-04-28 10:14:55,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {182887#(and (<= main_~y~0 30) (<= 30 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} is VALID [2022-04-28 10:14:55,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {182888#(and (<= main_~y~0 31) (<= 31 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} is VALID [2022-04-28 10:14:55,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {182889#(and (<= main_~y~0 32) (<= 32 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 10:14:55,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} assume !(~x~0 % 4294967296 > 0); {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} is VALID [2022-04-28 10:14:55,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {182890#(and (<= 33 main_~y~0) (<= main_~y~0 33))} ~z~0 := ~y~0; {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-28 10:14:55,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {182891#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183020#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-28 10:14:55,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {183020#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:55,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:55,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-28 10:14:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:14:55,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {182853#false} assume !false; {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {182853#false} assume 0 == ~cond; {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {182853#false} ~cond := #in~cond; {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L272 TraceCheckUtils]: 46: Hoare triple {182853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {182853#false} assume !(~y~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:57,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {182853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {182853#false} is VALID [2022-04-28 10:14:57,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {183066#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {182853#false} is VALID [2022-04-28 10:14:57,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {183070#(< 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; {183066#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:57,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {183070#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:57,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:57,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {183081#(< 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; {183074#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:57,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {183085#(< 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; {183081#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:57,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {183089#(< 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; {183085#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:57,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {183093#(< 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; {183089#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:57,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {183097#(< 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; {183093#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:57,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {183101#(< 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; {183097#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:57,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {183105#(< 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; {183101#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {183109#(< 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; {183105#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:57,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {183113#(< 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; {183109#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {183117#(< 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; {183113#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:57,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {183121#(< 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; {183117#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:57,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {183125#(< 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; {183121#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:57,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {183129#(< 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; {183125#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:57,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {183133#(< 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; {183129#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:57,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {183137#(< 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; {183133#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:57,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {183141#(< 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; {183137#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:57,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {183145#(< 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; {183141#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:57,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {183149#(< 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; {183145#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:57,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {183153#(< 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; {183149#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:57,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {183157#(< 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; {183153#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:57,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {183161#(< 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; {183157#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {183165#(< 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; {183161#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:14:57,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {183169#(< 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; {183165#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:14:57,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {183173#(< 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; {183169#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:14:57,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {183177#(< 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; {183173#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {183181#(< 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; {183177#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:14:57,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {183185#(< 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; {183181#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:14:57,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {183189#(< 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; {183185#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:14:57,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {183193#(< 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; {183189#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:14:57,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {183197#(< 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; {183193#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-28 10:14:57,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {183201#(< 0 (mod (+ 30 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; {183197#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {183205#(< 0 (mod (+ main_~y~0 31) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183201#(< 0 (mod (+ 30 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {183209#(< 0 (mod (+ 32 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; {183205#(< 0 (mod (+ main_~y~0 31) 4294967296))} is VALID [2022-04-28 10:14:57,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {182852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183209#(< 0 (mod (+ 32 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:57,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {182852#true} call #t~ret11 := main(); {182852#true} is VALID [2022-04-28 10:14:57,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182852#true} {182852#true} #61#return; {182852#true} is VALID [2022-04-28 10:14:57,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {182852#true} assume true; {182852#true} is VALID [2022-04-28 10:14:57,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {182852#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); {182852#true} is VALID [2022-04-28 10:14:57,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {182852#true} call ULTIMATE.init(); {182852#true} is VALID [2022-04-28 10:14:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:14:57,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380072239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:57,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:57,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 10:14:57,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361114224] [2022-04-28 10:14:57,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361114224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:57,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:57,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 10:14:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284615089] [2022-04-28 10:14:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 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 50 [2022-04-28 10:14:57,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:57,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:57,823 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-28 10:14:57,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 10:14:57,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 10:14:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1311, Invalid=4389, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:14:57,824 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:07,268 INFO L93 Difference]: Finished difference Result 385 states and 565 transitions. [2022-04-28 10:15:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 10:15:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 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 50 [2022-04-28 10:15:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 217 transitions. [2022-04-28 10:15:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 217 transitions. [2022-04-28 10:15:07,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 217 transitions. [2022-04-28 10:15:07,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:07,459 INFO L225 Difference]: With dead ends: 385 [2022-04-28 10:15:07,459 INFO L226 Difference]: Without dead ends: 377 [2022-04-28 10:15:07,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2729, Invalid=9927, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 10:15:07,460 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 187 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5573 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 5716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 5573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:07,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 251 Invalid, 5716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 5573 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 10:15:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-28 10:15:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 244. [2022-04-28 10:15:08,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:08,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:08,455 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:08,455 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:08,460 INFO L93 Difference]: Finished difference Result 377 states and 457 transitions. [2022-04-28 10:15:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 457 transitions. [2022-04-28 10:15:08,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:08,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:08,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 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 377 states. [2022-04-28 10:15:08,460 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 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 377 states. [2022-04-28 10:15:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:08,464 INFO L93 Difference]: Finished difference Result 377 states and 457 transitions. [2022-04-28 10:15:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 457 transitions. [2022-04-28 10:15:08,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:08,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:08,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:08,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 313 transitions. [2022-04-28 10:15:08,468 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 313 transitions. Word has length 50 [2022-04-28 10:15:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:08,468 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 313 transitions. [2022-04-28 10:15:08,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:08,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 313 transitions. [2022-04-28 10:15:09,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 313 transitions. [2022-04-28 10:15:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:15:09,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:09,344 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:09,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2022-04-28 10:15:09,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:09,544 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1735097903, now seen corresponding path program 273 times [2022-04-28 10:15:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:09,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770852429] [2022-04-28 10:15:09,546 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:09,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1735097903, now seen corresponding path program 274 times [2022-04-28 10:15:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:09,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167141154] [2022-04-28 10:15:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:10,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {185347#(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); {185316#true} is VALID [2022-04-28 10:15:10,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-28 10:15:10,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-28 10:15:10,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:10,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {185347#(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); {185316#true} is VALID [2022-04-28 10:15:10,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-28 10:15:10,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-28 10:15:10,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-28 10:15:10,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185321#(= main_~y~0 0)} is VALID [2022-04-28 10:15:10,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {185321#(= 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; {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:10,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {185322#(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; {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:10,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {185323#(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; {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:10,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {185324#(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; {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:10,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {185325#(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; {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:10,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {185326#(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; {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:10,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {185327#(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; {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:10,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {185328#(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; {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:10,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {185329#(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; {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:10,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {185330#(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; {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:10,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {185331#(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; {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:10,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {185332#(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; {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {185334#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:10,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {185334#(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; {185335#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:10,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {185335#(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; {185336#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:10,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {185336#(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; {185337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:10,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {185337#(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; {185338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:10,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {185338#(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; {185339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:10,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {185339#(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; {185340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:10,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {185340#(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; {185341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:10,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {185341#(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; {185342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:10,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {185342#(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; {185343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:10,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {185343#(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; {185344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:10,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {185344#(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; {185345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:10,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {185345#(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; {185346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {185346#(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; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {185317#false} assume !(~z~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {185317#false} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-28 10:15:10,027 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-28 10:15:10,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-28 10:15:10,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-28 10:15:10,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-28 10:15:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:10,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167141154] [2022-04-28 10:15:10,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167141154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:10,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147195484] [2022-04-28 10:15:10,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:10,048 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-04-28 10:15:10,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:10,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:10,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 10:15:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:10,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:10,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185316#true} is VALID [2022-04-28 10:15:10,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#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); {185316#true} is VALID [2022-04-28 10:15:10,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-28 10:15:10,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-28 10:15:10,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-28 10:15:10,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185321#(= main_~y~0 0)} is VALID [2022-04-28 10:15:10,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {185321#(= 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; {185322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:10,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {185322#(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; {185323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:10,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {185323#(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; {185324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:10,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {185324#(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; {185325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {185325#(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; {185326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:10,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {185326#(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; {185327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:10,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {185327#(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; {185328#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:10,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {185328#(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; {185329#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:10,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {185329#(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; {185330#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:10,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {185330#(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; {185331#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:10,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {185331#(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; {185332#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:10,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {185332#(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; {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {185333#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {185408#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {185408#(and (<= 12 main_~y~0) (= main_~z~0 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185412#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:10,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {185412#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= 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; {185416#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {185416#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185420#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:15:10,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {185420#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= 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; {185424#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {185424#(and (<= 12 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185428#(and (= (+ 5 main_~z~0) main_~y~0) (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {185428#(and (= (+ 5 main_~z~0) main_~y~0) (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185432#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {185432#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185436#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {185436#(and (<= 12 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185440#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 3)) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {185440#(and (<= 12 main_~y~0) (= (+ main_~y~0 (- 5)) (+ main_~z~0 3)) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185444#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {185444#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185448#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-28 10:15:10,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {185448#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ main_~z~0 2) (+ main_~y~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; {185452#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {185452#(and (<= 12 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 10))) (<= main_~y~0 12))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185456#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 11) main_~y~0) (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {185456#(and (<= 12 main_~y~0) (<= main_~y~0 12) (= (+ (- 11) 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; {185317#false} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {185317#false} assume !(~z~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {185317#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {185317#false} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-28 10:15:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:10,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:11,965 INFO L290 TraceCheckUtils]: 50: Hoare triple {185317#false} assume !false; {185317#false} is VALID [2022-04-28 10:15:11,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {185317#false} assume 0 == ~cond; {185317#false} is VALID [2022-04-28 10:15:11,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {185317#false} ~cond := #in~cond; {185317#false} is VALID [2022-04-28 10:15:11,965 INFO L272 TraceCheckUtils]: 47: Hoare triple {185317#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {185317#false} is VALID [2022-04-28 10:15:11,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {185526#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {185317#false} is VALID [2022-04-28 10:15:11,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {185530#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185526#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:11,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {185534#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185530#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:11,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {185538#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185534#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:11,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {185542#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185538#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:11,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {185546#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185542#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {185550#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185546#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {185554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185550#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {185558#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185554#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:11,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {185562#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185558#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:11,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {185566#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185562#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:15:11,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {185570#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185566#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-28 10:15:11,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {185570#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-28 10:15:11,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} assume !(~z~0 % 4294967296 > 0); {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} is VALID [2022-04-28 10:15:11,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {185581#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185574#(< 0 (mod (+ main_~y~0 4294967284) 4294967296))} is VALID [2022-04-28 10:15:11,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {185585#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185581#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:15:11,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {185589#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185585#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-28 10:15:11,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {185593#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185589#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:15:11,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {185597#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185593#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-28 10:15:11,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {185601#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185597#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:11,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {185605#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185601#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:11,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {185609#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185605#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:11,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {185613#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185609#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 10:15:11,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {185617#(or (< 0 (mod (+ main_~y~0 4294967284) 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; {185613#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 10:15:11,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {185621#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185617#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-28 10:15:11,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {185625#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185621#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (< 0 (mod (+ main_~y~0 4294967284) 4294967296)))} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {185629#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967284) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {185625#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967285) 4294967296))))} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {185316#true} ~z~0 := ~y~0; {185629#(or (< 0 (mod (+ main_~y~0 4294967284) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967284) 4294967296))))} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {185316#true} assume !(~x~0 % 4294967296 > 0); {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {185316#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; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {185316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {185316#true} call #t~ret11 := main(); {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185316#true} {185316#true} #61#return; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {185316#true} assume true; {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {185316#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); {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {185316#true} call ULTIMATE.init(); {185316#true} is VALID [2022-04-28 10:15:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147195484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:11,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:11,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 68 [2022-04-28 10:15:11,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:11,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770852429] [2022-04-28 10:15:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770852429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:11,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:15:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433087191] [2022-04-28 10:15:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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 51 [2022-04-28 10:15:11,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:11,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-28 10:15:12,013 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-28 10:15:12,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:15:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:15:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=3890, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:15:12,014 INFO L87 Difference]: Start difference. First operand 244 states and 313 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-28 10:15:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:14,875 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2022-04-28 10:15:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:15:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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 51 [2022-04-28 10:15:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-28 10:15:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-28 10:15:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-28 10:15:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2022-04-28 10:15:14,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 53 transitions. [2022-04-28 10:15:14,914 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-28 10:15:14,916 INFO L225 Difference]: With dead ends: 262 [2022-04-28 10:15:14,916 INFO L226 Difference]: Without dead ends: 229 [2022-04-28 10:15:14,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1290, Invalid=7452, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 10:15:14,917 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:14,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:15:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-28 10:15:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-04-28 10:15:15,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:15,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:15,823 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:15,823 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:15,825 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-04-28 10:15:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-28 10:15:15,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:15,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:15,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 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 229 states. [2022-04-28 10:15:15,825 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 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 229 states. [2022-04-28 10:15:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:15,828 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-04-28 10:15:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-28 10:15:15,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:15,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:15,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:15,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 224 states have internal predecessors, (292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-04-28 10:15:15,831 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 51 [2022-04-28 10:15:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:15,831 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-04-28 10:15:15,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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-28 10:15:15,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 296 transitions. [2022-04-28 10:15:16,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-04-28 10:15:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:15:16,631 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:16,631 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2022-04-28 10:15:16,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:16,831 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash -706861889, now seen corresponding path program 275 times [2022-04-28 10:15:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:16,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710514571] [2022-04-28 10:15:16,833 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:16,833 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -706861889, now seen corresponding path program 276 times [2022-04-28 10:15:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:16,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487262035] [2022-04-28 10:15:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:17,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {187215#(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); {187184#true} is VALID [2022-04-28 10:15:17,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-28 10:15:17,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-28 10:15:17,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:17,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {187215#(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); {187184#true} is VALID [2022-04-28 10:15:17,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-28 10:15:17,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-28 10:15:17,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-28 10:15:17,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187189#(= main_~y~0 0)} is VALID [2022-04-28 10:15:17,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {187189#(= 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; {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:17,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {187190#(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; {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:17,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {187191#(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; {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:17,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {187192#(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; {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:17,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {187193#(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; {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:17,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {187194#(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; {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:17,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {187195#(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; {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:17,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {187196#(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; {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:17,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {187197#(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; {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:17,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {187198#(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; {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:17,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {187199#(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; {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:17,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {187200#(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; {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:17,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {187201#(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; {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:17,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:17,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {187203#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:17,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {187203#(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; {187204#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:17,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {187204#(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; {187205#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:17,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {187205#(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; {187206#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:17,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {187206#(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; {187207#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:17,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {187207#(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; {187208#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:17,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {187208#(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; {187209#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:17,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {187209#(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; {187210#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:17,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {187210#(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; {187211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:17,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {187211#(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; {187212#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:17,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {187212#(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; {187213#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:17,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {187213#(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; {187214#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {187214#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-28 10:15:17,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-28 10:15:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:15:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:17,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487262035] [2022-04-28 10:15:17,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487262035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:17,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94269777] [2022-04-28 10:15:17,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:17,325 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:17,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-04-28 10:15:17,859 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:15:17,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:17,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 10:15:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:17,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:18,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187184#true} is VALID [2022-04-28 10:15:18,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#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); {187184#true} is VALID [2022-04-28 10:15:18,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-28 10:15:18,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-28 10:15:18,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-28 10:15:18,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187189#(= main_~y~0 0)} is VALID [2022-04-28 10:15:18,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {187189#(= 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; {187190#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:18,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {187190#(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; {187191#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:18,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {187191#(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; {187192#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:18,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {187192#(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; {187193#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:18,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {187193#(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; {187194#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:18,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {187194#(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; {187195#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:18,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {187195#(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; {187196#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:18,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {187196#(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; {187197#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:18,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {187197#(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; {187198#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:18,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {187198#(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; {187199#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:18,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {187199#(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; {187200#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:18,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {187200#(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; {187201#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:18,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {187201#(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; {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {187202#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {187279#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {187279#(and (<= main_~y~0 13) (= main_~z~0 main_~y~0) (<= 13 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; {187283#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:15:18,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {187283#(and (<= main_~y~0 13) (<= 13 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; {187287#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {187287#(and (<= main_~y~0 13) (= main_~y~0 (+ main_~z~0 2)) (<= 13 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; {187291#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {187291#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 13 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; {187295#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:15:18,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {187295#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187299#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {187299#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 13 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; {187303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {187303#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 13) (<= 13 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; {187307#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ 5 main_~z~0)) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {187307#(and (<= main_~y~0 13) (= (+ (- 2) main_~y~0) (+ 5 main_~z~0)) (<= 13 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; {187311#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {187311#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 13 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; {187315#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {187315#(and (<= main_~y~0 13) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 13 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; {187319#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 8))))} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {187319#(and (<= main_~y~0 13) (<= 13 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~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; {187323#(and (<= main_~y~0 13) (= (+ main_~z~0 3) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {187323#(and (<= main_~y~0 13) (= (+ main_~z~0 3) (+ main_~y~0 (- 8))) (<= 13 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-28 10:15:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:15:18,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:19,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {187185#false} assume !false; {187185#false} is VALID [2022-04-28 10:15:19,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {187185#false} assume 0 == ~cond; {187185#false} is VALID [2022-04-28 10:15:19,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {187185#false} ~cond := #in~cond; {187185#false} is VALID [2022-04-28 10:15:19,571 INFO L272 TraceCheckUtils]: 47: Hoare triple {187185#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {187185#false} is VALID [2022-04-28 10:15:19,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {187185#false} assume !(~y~0 % 4294967296 > 0); {187185#false} is VALID [2022-04-28 10:15:19,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {187185#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:19,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {187399#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187185#false} is VALID [2022-04-28 10:15:19,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {187403#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187399#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:15:19,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {187407#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187403#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:19,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {187411#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187407#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:15:19,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {187415#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187411#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:15:19,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {187419#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187415#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:19,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {187423#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187419#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:19,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {187427#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187423#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:19,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {187431#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187427#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:15:19,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {187435#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187431#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:15:19,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {187439#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187435#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:15:19,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {187443#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {187439#(not (< 0 (mod (+ main_~y~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:15:19,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {187447#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {187443#(not (< 0 (mod (+ main_~y~0 4294967285) 4294967296)))} is VALID [2022-04-28 10:15:19,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {187451#(or (not (< 0 (mod (+ main_~y~0 4294967285) 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; {187447#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:15:19,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {187455#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187451#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:15:19,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {187459#(or (not (< 0 (mod (+ main_~y~0 4294967285) 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; {187455#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:15:19,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {187463#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187459#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:15:19,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {187467#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187463#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:19,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {187471#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187467#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:19,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {187475#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187471#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:19,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {187479#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187475#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:15:19,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {187483#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 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; {187479#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:15:19,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {187487#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187483#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:15:19,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {187491#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187487#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {187184#true} ~z~0 := ~y~0; {187491#(or (not (< 0 (mod (+ main_~y~0 4294967285) 4294967296))) (< 0 (mod (+ main_~z~0 4294967285) 4294967296)))} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {187184#true} assume !(~x~0 % 4294967296 > 0); {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {187184#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; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {187184#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {187184#true} call #t~ret11 := main(); {187184#true} is VALID [2022-04-28 10:15:19,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187184#true} {187184#true} #61#return; {187184#true} is VALID [2022-04-28 10:15:19,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {187184#true} assume true; {187184#true} is VALID [2022-04-28 10:15:19,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {187184#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); {187184#true} is VALID [2022-04-28 10:15:19,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {187184#true} call ULTIMATE.init(); {187184#true} is VALID [2022-04-28 10:15:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 24 proven. 132 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 10:15:19,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94269777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:19,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 26] total 65 [2022-04-28 10:15:19,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:19,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710514571] [2022-04-28 10:15:19,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710514571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:19,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:19,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:15:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903586686] [2022-04-28 10:15:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:19,591 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 51 [2022-04-28 10:15:19,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:19,591 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-28 10:15:19,615 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-28 10:15:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:15:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:15:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3692, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:15:19,616 INFO L87 Difference]: Start difference. First operand 229 states and 296 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-28 10:15:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:23,180 INFO L93 Difference]: Finished difference Result 264 states and 331 transitions. [2022-04-28 10:15:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:15:23,180 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 51 [2022-04-28 10:15:23,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:23,180 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-28 10:15:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-28 10:15:23,181 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-28 10:15:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-28 10:15:23,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 69 transitions. [2022-04-28 10:15:23,236 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-28 10:15:23,238 INFO L225 Difference]: With dead ends: 264 [2022-04-28 10:15:23,239 INFO L226 Difference]: Without dead ends: 245 [2022-04-28 10:15:23,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=778, Invalid=7412, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:15:23,239 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:23,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-04-28 10:15:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 230. [2022-04-28 10:15:24,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:24,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:24,139 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:24,139 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:24,142 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2022-04-28 10:15:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2022-04-28 10:15:24,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:24,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:24,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 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 245 states. [2022-04-28 10:15:24,142 INFO L87 Difference]: Start difference. First operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 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 245 states. [2022-04-28 10:15:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:24,144 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2022-04-28 10:15:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 312 transitions. [2022-04-28 10:15:24,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:24,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:24,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:24,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 225 states have internal predecessors, (293), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 297 transitions. [2022-04-28 10:15:24,147 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 297 transitions. Word has length 51 [2022-04-28 10:15:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:24,148 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 297 transitions. [2022-04-28 10:15:24,148 INFO L496 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-28 10:15:24,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 297 transitions. [2022-04-28 10:15:24,937 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-28 10:15:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 297 transitions. [2022-04-28 10:15:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:15:24,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:24,938 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:24,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2022-04-28 10:15:25,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:25,138 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 85668975, now seen corresponding path program 277 times [2022-04-28 10:15:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:25,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402906301] [2022-04-28 10:15:25,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:25,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 85668975, now seen corresponding path program 278 times [2022-04-28 10:15:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054752877] [2022-04-28 10:15:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {189117#(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); {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:25,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {189117#(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); {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-28 10:15:25,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-28 10:15:25,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189092#(= main_~y~0 0)} is VALID [2022-04-28 10:15:25,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {189092#(= 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; {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:25,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {189093#(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; {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:25,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {189094#(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; {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:25,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {189095#(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; {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:25,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {189096#(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; {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:25,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {189097#(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; {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:25,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {189098#(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; {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:25,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {189099#(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; {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:25,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {189100#(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; {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:25,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {189101#(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; {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:25,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {189102#(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; {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:25,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {189103#(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; {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:25,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {189104#(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; {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:25,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {189105#(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; {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:25,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:25,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:25,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:25,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {189108#(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; {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:25,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {189109#(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; {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:25,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {189110#(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; {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:25,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {189111#(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; {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:25,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {189112#(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; {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:25,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {189113#(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; {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:25,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {189114#(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; {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:25,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {189115#(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; {189116#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:25,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {189116#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:25,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-28 10:15:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054752877] [2022-04-28 10:15:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054752877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866634039] [2022-04-28 10:15:25,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:25,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:25,594 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-04-28 10:15:25,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:25,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:25,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:15:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:26,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189087#true} is VALID [2022-04-28 10:15:26,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#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); {189087#true} is VALID [2022-04-28 10:15:26,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-28 10:15:26,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-28 10:15:26,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-28 10:15:26,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189092#(= main_~y~0 0)} is VALID [2022-04-28 10:15:26,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {189092#(= 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; {189093#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:26,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {189093#(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; {189094#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:26,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {189094#(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; {189095#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:26,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {189095#(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; {189096#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:26,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {189096#(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; {189097#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:26,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {189097#(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; {189098#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:26,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {189098#(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; {189099#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:26,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {189099#(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; {189100#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:26,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {189100#(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; {189101#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:26,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {189101#(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; {189102#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:26,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {189102#(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; {189103#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:26,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {189103#(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; {189104#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:26,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {189104#(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; {189105#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:26,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {189105#(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; {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:26,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:26,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {189106#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:26,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {189107#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {189108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:26,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {189108#(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; {189109#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:26,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {189109#(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; {189110#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:26,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {189110#(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; {189111#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:26,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {189111#(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; {189112#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:26,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {189112#(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; {189113#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:26,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {189113#(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; {189114#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:26,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {189114#(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; {189115#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:26,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {189115#(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; {189211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:26,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {189211#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:26,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-28 10:15:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:26,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:26,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {189088#false} assume !false; {189088#false} is VALID [2022-04-28 10:15:26,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {189088#false} assume 0 == ~cond; {189088#false} is VALID [2022-04-28 10:15:26,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {189088#false} ~cond := #in~cond; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L272 TraceCheckUtils]: 47: Hoare triple {189088#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {189088#false} assume !(~y~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {189088#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {189088#false} is VALID [2022-04-28 10:15:26,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {189329#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {189088#false} is VALID [2022-04-28 10:15:26,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {189333#(< 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; {189329#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:26,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {189337#(< 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; {189333#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:26,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {189341#(< 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; {189337#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:26,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {189345#(< 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; {189341#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:26,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {189349#(< 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; {189345#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:26,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {189353#(< 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; {189349#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:26,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {189357#(< 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; {189353#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:26,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {189361#(< 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; {189357#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:26,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {189365#(< 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; {189361#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:26,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {189365#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-28 10:15:26,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:15:26,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {189376#(< 0 (mod (+ 4294967288 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; {189369#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-28 10:15:26,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {189380#(< 0 (mod (+ main_~y~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; {189376#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {189384#(< 0 (mod (+ 4294967290 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; {189380#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:26,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {189388#(< 0 (mod (+ 4294967291 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; {189384#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {189392#(< 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; {189388#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {189396#(< 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; {189392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {189400#(< 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; {189396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:26,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {189404#(< 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; {189400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:26,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {189408#(< 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; {189404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:26,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {189412#(< 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; {189408#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:26,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {189416#(< 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; {189412#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:26,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {189420#(< 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; {189416#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:26,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {189424#(< 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; {189420#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:26,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {189428#(< 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; {189424#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:26,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {189087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {189428#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {189087#true} call #t~ret11 := main(); {189087#true} is VALID [2022-04-28 10:15:26,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189087#true} {189087#true} #61#return; {189087#true} is VALID [2022-04-28 10:15:26,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {189087#true} assume true; {189087#true} is VALID [2022-04-28 10:15:26,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {189087#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); {189087#true} is VALID [2022-04-28 10:15:26,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {189087#true} call ULTIMATE.init(); {189087#true} is VALID [2022-04-28 10:15:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:26,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866634039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:26,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:26,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:15:26,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:26,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402906301] [2022-04-28 10:15:26,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402906301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:26,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:26,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:15:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691069240] [2022-04-28 10:15:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:26,999 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 51 [2022-04-28 10:15:27,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:27,000 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-28 10:15:27,025 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-28 10:15:27,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:15:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:15:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=2432, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:15:27,026 INFO L87 Difference]: Start difference. First operand 230 states and 297 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-28 10:15:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:30,584 INFO L93 Difference]: Finished difference Result 267 states and 334 transitions. [2022-04-28 10:15:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:15:30,584 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 51 [2022-04-28 10:15:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:30,584 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-28 10:15:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 82 transitions. [2022-04-28 10:15:30,585 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-28 10:15:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 82 transitions. [2022-04-28 10:15:30,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 82 transitions. [2022-04-28 10:15:30,649 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-28 10:15:30,652 INFO L225 Difference]: With dead ends: 267 [2022-04-28 10:15:30,652 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 10:15:30,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1310, Invalid=6346, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:15:30,652 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:30,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:15:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 10:15:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2022-04-28 10:15:31,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:31,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:31,554 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:31,554 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:31,557 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2022-04-28 10:15:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 314 transitions. [2022-04-28 10:15:31,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:31,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:31,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 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 247 states. [2022-04-28 10:15:31,557 INFO L87 Difference]: Start difference. First operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 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 247 states. [2022-04-28 10:15:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:31,560 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2022-04-28 10:15:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 314 transitions. [2022-04-28 10:15:31,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:31,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:31,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:31,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 226 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 298 transitions. [2022-04-28 10:15:31,563 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 298 transitions. Word has length 51 [2022-04-28 10:15:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:31,563 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 298 transitions. [2022-04-28 10:15:31,563 INFO L496 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-28 10:15:31,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 298 transitions. [2022-04-28 10:15:32,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 298 transitions. [2022-04-28 10:15:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:15:32,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:32,365 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:32,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2022-04-28 10:15:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:32,565 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1628941951, now seen corresponding path program 279 times [2022-04-28 10:15:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:32,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767564595] [2022-04-28 10:15:32,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:32,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1628941951, now seen corresponding path program 280 times [2022-04-28 10:15:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:32,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600296834] [2022-04-28 10:15:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:32,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {191036#(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); {191007#true} is VALID [2022-04-28 10:15:32,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-28 10:15:32,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-28 10:15:32,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:32,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {191036#(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); {191007#true} is VALID [2022-04-28 10:15:32,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-28 10:15:32,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-28 10:15:32,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-28 10:15:32,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191012#(= main_~y~0 0)} is VALID [2022-04-28 10:15:32,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {191012#(= 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; {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:32,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {191013#(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; {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:32,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {191014#(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; {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:32,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {191015#(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; {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:32,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {191016#(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; {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:32,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {191017#(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; {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:33,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {191018#(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; {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:33,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {191019#(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; {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:33,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {191020#(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; {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:33,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {191021#(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; {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:33,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {191022#(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; {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:33,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {191023#(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; {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:33,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {191024#(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; {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:33,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {191025#(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; {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:33,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {191026#(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; {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:33,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:33,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:15:33,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {191028#(and (<= main_~z~0 15) (<= 15 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; {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:33,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:33,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {191030#(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; {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:33,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {191031#(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; {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:33,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {191032#(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; {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:33,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {191033#(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; {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:33,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {191034#(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; {191035#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:33,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {191035#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:33,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-28 10:15:33,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-28 10:15:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:15:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:33,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600296834] [2022-04-28 10:15:33,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600296834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:33,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58037561] [2022-04-28 10:15:33,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:33,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:33,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:33,011 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:33,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-04-28 10:15:33,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:33,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:33,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:15:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:33,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:33,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191007#true} is VALID [2022-04-28 10:15:33,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#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); {191007#true} is VALID [2022-04-28 10:15:33,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-28 10:15:33,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-28 10:15:33,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-28 10:15:33,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191012#(= main_~y~0 0)} is VALID [2022-04-28 10:15:33,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {191012#(= 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; {191013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:33,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {191013#(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; {191014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:33,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {191014#(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; {191015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:33,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {191015#(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; {191016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:33,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {191016#(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; {191017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:33,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {191017#(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; {191018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:33,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {191018#(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; {191019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:33,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {191019#(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; {191020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:33,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {191020#(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; {191021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:33,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {191021#(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; {191022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:33,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {191022#(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; {191023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:33,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {191023#(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; {191024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:33,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {191024#(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; {191025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:33,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {191025#(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; {191026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:33,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {191026#(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; {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:33,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:33,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {191027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {191028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:15:33,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {191028#(and (<= main_~z~0 15) (<= 15 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; {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:33,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {191029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191030#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:33,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {191030#(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; {191031#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:33,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {191031#(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; {191032#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:33,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {191032#(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; {191033#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:33,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {191033#(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; {191034#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:33,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {191034#(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; {191127#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:33,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {191127#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-28 10:15:33,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-28 10:15:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:15:33,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:34,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {191008#false} assume !false; {191008#false} is VALID [2022-04-28 10:15:34,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {191008#false} assume 0 == ~cond; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {191008#false} ~cond := #in~cond; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L272 TraceCheckUtils]: 47: Hoare triple {191008#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {191008#false} assume !(~y~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {191008#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {191008#false} is VALID [2022-04-28 10:15:34,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {191251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {191008#false} is VALID [2022-04-28 10:15:34,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {191255#(< 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; {191251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:34,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {191259#(< 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; {191255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:34,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {191263#(< 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; {191259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:34,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {191267#(< 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; {191263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:34,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {191271#(< 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; {191267#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:34,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {191275#(< 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; {191271#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:34,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {191279#(< 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; {191275#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:34,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {191279#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:34,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:34,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {191290#(< 0 (mod (+ 4294967290 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; {191283#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:15:34,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {191294#(< 0 (mod (+ 4294967291 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; {191290#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:34,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {191298#(< 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; {191294#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:34,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {191302#(< 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; {191298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:34,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {191306#(< 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; {191302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:34,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {191310#(< 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; {191306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:34,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {191314#(< 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; {191310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:34,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {191318#(< 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; {191314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:34,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {191322#(< 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; {191318#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:34,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {191326#(< 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; {191322#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:34,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {191330#(< 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; {191326#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:34,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {191334#(< 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; {191330#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:34,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {191338#(< 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; {191334#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:34,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {191342#(< 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; {191338#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:34,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {191346#(< 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; {191342#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:34,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {191007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191346#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:34,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {191007#true} call #t~ret11 := main(); {191007#true} is VALID [2022-04-28 10:15:34,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191007#true} {191007#true} #61#return; {191007#true} is VALID [2022-04-28 10:15:34,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {191007#true} assume true; {191007#true} is VALID [2022-04-28 10:15:34,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {191007#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); {191007#true} is VALID [2022-04-28 10:15:34,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {191007#true} call ULTIMATE.init(); {191007#true} is VALID [2022-04-28 10:15:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:15:34,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58037561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:34,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:34,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:15:34,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767564595] [2022-04-28 10:15:34,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767564595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:34,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:34,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:15:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117760066] [2022-04-28 10:15:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:34,350 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 51 [2022-04-28 10:15:34,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:34,350 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-28 10:15:34,374 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-28 10:15:34,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:15:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:15:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=2223, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:15:34,375 INFO L87 Difference]: Start difference. First operand 231 states and 298 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-28 10:15:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:38,447 INFO L93 Difference]: Finished difference Result 270 states and 337 transitions. [2022-04-28 10:15:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 10:15:38,447 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 51 [2022-04-28 10:15:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:38,447 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-28 10:15:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2022-04-28 10:15:38,448 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-28 10:15:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 90 transitions. [2022-04-28 10:15:38,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 90 transitions. [2022-04-28 10:15:38,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:38,522 INFO L225 Difference]: With dead ends: 270 [2022-04-28 10:15:38,522 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 10:15:38,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1407, Invalid=6425, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 10:15:38,522 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:38,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 142 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:15:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states.