/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-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:08:57,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:08:57,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:08:57,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:08:57,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:08:57,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:08:57,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:08:57,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:08:57,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:08:57,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:08:57,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:08:57,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:08:57,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:08:57,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:08:57,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:08:57,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:08:57,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:08:57,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:08:57,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:08:57,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:08:57,912 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:08:57,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:08:57,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:08:57,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:08:57,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:08:57,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:08:57,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:08:57,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:08:57,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:08:57,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:08:57,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:08:57,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:08:57,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:08:57,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:08:57,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:08:57,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:08:57,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:08:57,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:08:57,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:08:57,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:08:57,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:08:57,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:08:57,925 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:08:57,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:08:57,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:08:57,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:08:57,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:08:57,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:08:57,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:08:57,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:08:57,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:08:57,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:08:57,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:57,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:08:57,934 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:08:57,934 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:08:58,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:08:58,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:08:58,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:08:58,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:08:58,128 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:08:58,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-28 10:08:58,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ccb1adf/bc310de235b447cb93f6df2f6732a50f/FLAG792ffdb66 [2022-04-28 10:08:58,477 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:08:58,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-28 10:08:58,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ccb1adf/bc310de235b447cb93f6df2f6732a50f/FLAG792ffdb66 [2022-04-28 10:08:58,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ccb1adf/bc310de235b447cb93f6df2f6732a50f [2022-04-28 10:08:58,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:08:58,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:08:58,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:58,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:08:58,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:08:58,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:58" (1/1) ... [2022-04-28 10:08:58,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba12fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:58, skipping insertion in model container [2022-04-28 10:08:58,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:08:58" (1/1) ... [2022-04-28 10:08:58,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:08:58,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:08:59,045 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-de62.c[368,381] [2022-04-28 10:08:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:59,074 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:08:59,081 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-de62.c[368,381] [2022-04-28 10:08:59,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:08:59,092 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:08:59,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59 WrapperNode [2022-04-28 10:08:59,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:08:59,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:08:59,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:08:59,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:08:59,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:08:59,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:08:59,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:08:59,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:08:59,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (1/1) ... [2022-04-28 10:08:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:08:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:59,136 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:08:59,139 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:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:08:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:08:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:08:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:08:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:08:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:08:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:08:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:08:59,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:08:59,212 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:08:59,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:08:59,384 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:08:59,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:08:59,388 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 10:08:59,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:59 BoogieIcfgContainer [2022-04-28 10:08:59,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:08:59,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:08:59,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:08:59,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:08:59,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:08:58" (1/3) ... [2022-04-28 10:08:59,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eac37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:59, skipping insertion in model container [2022-04-28 10:08:59,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:08:59" (2/3) ... [2022-04-28 10:08:59,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eac37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:08:59, skipping insertion in model container [2022-04-28 10:08:59,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:08:59" (3/3) ... [2022-04-28 10:08:59,412 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-04-28 10:08:59,420 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:08:59,421 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:08:59,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:08:59,460 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@4341f7f8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2102a0e1 [2022-04-28 10:08:59,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:08:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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:08:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:59,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:59,479 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:08:59,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-28 10:08:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128269861] [2022-04-28 10:08:59,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-28 10:08:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:59,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480894980] [2022-04-28 10:08:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:59,658 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); {28#true} is VALID [2022-04-28 10:08:59,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:08:59,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 10:08:59,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:59,666 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); {28#true} is VALID [2022-04-28 10:08:59,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:08:59,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-28 10:08:59,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-28 10:08:59,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-28 10:08:59,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:59,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-28 10:08:59,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:59,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-28 10:08:59,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 10:08:59,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 10:08:59,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-28 10:08:59,668 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-28 10:08:59,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 10:08:59,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 10:08:59,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 10:08:59,669 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:08:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480894980] [2022-04-28 10:08:59,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480894980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:59,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:59,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128269861] [2022-04-28 10:08:59,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128269861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:59,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:59,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:08:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449529184] [2022-04-28 10:08:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:59,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,702 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:08:59,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:08:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:08:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:59,729 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,824 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-28 10:08:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:08:59,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:08:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:08:59,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 10:08:59,907 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:08:59,917 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:08:59,917 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:08:59,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:08:59,923 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:59,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:08:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:08:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 10:08:59,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:59,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:08:59,944 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:08:59,945 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:08:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,949 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 10:08:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:59,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:59,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:59,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-28 10:08:59,950 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-28 10:08:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:59,955 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-28 10:08:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:59,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:59,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:59,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:59,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:08:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-28 10:08:59,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-28 10:08:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:59,958 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-28 10:08:59,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:08:59,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-28 10:08:59,982 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:08:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-28 10:08:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:08:59,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:59,983 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:08:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:08:59,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-28 10:08:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509902736] [2022-04-28 10:08:59,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:08:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-28 10:08:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:59,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376663745] [2022-04-28 10:08:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 10:09:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 10:09:00,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 10:09:00,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:00,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 10:09:00,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 10:09:00,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-28 10:09:00,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-28 10:09:00,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194#true} is VALID [2022-04-28 10:09:00,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 10:09:00,076 INFO L272 TraceCheckUtils]: 13: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:00,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {201#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:00,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-28 10:09:00,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 10:09:00,077 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:09:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:00,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376663745] [2022-04-28 10:09:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376663745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:00,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509902736] [2022-04-28 10:09:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509902736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716849145] [2022-04-28 10:09:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:09:00,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:00,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,094 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:09:00,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:09:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:09:00,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:09:00,095 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,256 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 10:09:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:09:00,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:09:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 10:09:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 10:09:00,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 10:09:00,295 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:09:00,296 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:09:00,297 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:09:00,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:09:00,298 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:09:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:09:00,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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,303 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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,303 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,304 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 10:09:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:09:00,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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:09:00,305 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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:09:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,306 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 10:09:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:09:00,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call 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,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-28 10:09:00,308 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-04-28 10:09:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,308 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-28 10:09:00,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:00,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-28 10:09:00,335 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:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 10:09:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:09:00,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:00,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:09:00,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-04-28 10:09:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624999015] [2022-04-28 10:09:00,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 2 times [2022-04-28 10:09:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:00,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202185830] [2022-04-28 10:09:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-28 10:09:00,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-28 10:09:00,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-28 10:09:00,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:00,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-28 10:09:00,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-28 10:09:00,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-28 10:09:00,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret17 := main(); {371#true} is VALID [2022-04-28 10:09:00,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {371#true} is VALID [2022-04-28 10:09:00,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~x~0 % 4294967296 > 0); {371#true} is VALID [2022-04-28 10:09:00,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} ~z~0 := ~y~0; {371#true} is VALID [2022-04-28 10:09:00,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !(~z~0 % 4294967296 > 0); {371#true} is VALID [2022-04-28 10:09:00,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(~y~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {372#false} is VALID [2022-04-28 10:09:00,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(~y~0 % 4294967296 > 0); {372#false} is VALID [2022-04-28 10:09:00,423 INFO L272 TraceCheckUtils]: 14: Hoare triple {372#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-28 10:09:00,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-28 10:09:00,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-28 10:09:00,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-28 10:09:00,424 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:09:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:00,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202185830] [2022-04-28 10:09:00,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202185830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:00,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:00,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624999015] [2022-04-28 10:09:00,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624999015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747391501] [2022-04-28 10:09:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:00,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,453 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:09:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:09:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:09:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:09:00,454 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,577 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-28 10:09:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:09:00,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-28 10:09:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-28 10:09:00,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-28 10:09:00,615 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:09:00,617 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:09:00,617 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:09:00,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:09:00,619 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:09:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 10:09:00,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call 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,639 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call 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,639 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call 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,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,640 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-28 10:09:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 10:09:00,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:09:00,641 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:09:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,642 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-28 10:09:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 10:09:00,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call 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,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-28 10:09:00,643 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2022-04-28 10:09:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,644 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-28 10:09:00,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-28 10:09:00,686 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:09:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 10:09:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:09:00,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:00,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:00,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:09:00,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-04-28 10:09:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690262024] [2022-04-28 10:09:00,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 2 times [2022-04-28 10:09:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704563378] [2022-04-28 10:09:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:00,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 10:09:00,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 10:09:00,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-28 10:09:00,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:00,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 10:09:00,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 10:09:00,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-28 10:09:00,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret17 := main(); {609#true} is VALID [2022-04-28 10:09:00,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {609#true} is VALID [2022-04-28 10:09:00,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#true} assume !(~x~0 % 4294967296 > 0); {609#true} is VALID [2022-04-28 10:09:00,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~z~0 := ~y~0; {609#true} is VALID [2022-04-28 10:09:00,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume !(~z~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {610#false} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume !(~z~0 % 4294967296 > 0); {610#false} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#false} assume !(~y~0 % 4294967296 > 0); {610#false} is VALID [2022-04-28 10:09:00,740 INFO L272 TraceCheckUtils]: 14: Hoare triple {610#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {610#false} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} ~cond := #in~cond; {610#false} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#false} assume 0 == ~cond; {610#false} is VALID [2022-04-28 10:09:00,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-04-28 10:09:00,741 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:09:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704563378] [2022-04-28 10:09:00,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704563378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:00,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690262024] [2022-04-28 10:09:00,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690262024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:00,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:00,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031076245] [2022-04-28 10:09:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:00,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,759 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:09:00,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:09:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:09:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:09:00,760 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,854 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-04-28 10:09:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:09:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:09:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 10:09:00,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 10:09:00,887 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:09:00,888 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:09:00,888 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:09:00,888 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:09:00,889 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:00,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:09:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 10:09:00,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:00,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call 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,909 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call 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,909 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call 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,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,910 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-28 10:09:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 10:09:00,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:09:00,910 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 10:09:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:00,911 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-28 10:09:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 10:09:00,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:00,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:00,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:00,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call 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,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 10:09:00,913 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 18 [2022-04-28 10:09:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:00,913 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-04-28 10:09:00,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:09:00,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 10:09:00,961 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:09:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-28 10:09:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:09:00,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:00,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:00,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:09:00,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 1 times [2022-04-28 10:09:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:00,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095430088] [2022-04-28 10:09:00,976 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:00,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 2 times [2022-04-28 10:09:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358268584] [2022-04-28 10:09:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-28 10:09:01,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 10:09:01,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-28 10:09:01,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:01,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {866#true} is VALID [2022-04-28 10:09:01,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 10:09:01,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-28 10:09:01,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret17 := main(); {866#true} is VALID [2022-04-28 10:09:01,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {871#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {871#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(= main_~y~0 0)} ~z~0 := ~y~0; {872#(= main_~z~0 0)} is VALID [2022-04-28 10:09:01,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(= 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; {867#false} is VALID [2022-04-28 10:09:01,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 10:09:01,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 10:09:01,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {867#false} is VALID [2022-04-28 10:09:01,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume !(~x~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 10:09:01,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 10:09:01,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {867#false} is VALID [2022-04-28 10:09:01,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-28 10:09:01,032 INFO L272 TraceCheckUtils]: 16: Hoare triple {867#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {867#false} is VALID [2022-04-28 10:09:01,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-28 10:09:01,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-28 10:09:01,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-28 10:09:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358268584] [2022-04-28 10:09:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358268584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:01,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:01,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:01,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:01,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095430088] [2022-04-28 10:09:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095430088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:01,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:01,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689429917] [2022-04-28 10:09:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:09:01,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:01,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,047 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:09:01,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:09:01,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:09:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:09:01,048 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,140 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 10:09:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:09:01,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:09:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:09:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:09:01,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-28 10:09:01,166 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:09:01,167 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:09:01,167 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:09:01,167 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:09:01,168 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:01,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:09:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 10:09:01,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:01,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call 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:01,183 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call 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:01,183 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call 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:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,184 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-28 10:09:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 10:09:01,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:09:01,185 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 10:09:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:01,186 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-28 10:09:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 10:09:01,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:01,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:01,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:01,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call 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:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-28 10:09:01,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2022-04-28 10:09:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:01,187 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-04-28 10:09:01,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:01,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2022-04-28 10:09:01,222 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:09:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-28 10:09:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:09:01,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:01,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:01,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 10:09:01,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-04-28 10:09:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:01,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019283870] [2022-04-28 10:09:01,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:01,227 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 2 times [2022-04-28 10:09:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:01,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854146685] [2022-04-28 10:09:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {1114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1106#true} is VALID [2022-04-28 10:09:01,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-28 10:09:01,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #94#return; {1106#true} is VALID [2022-04-28 10:09:01,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:01,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1106#true} is VALID [2022-04-28 10:09:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-28 10:09:01,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #94#return; {1106#true} is VALID [2022-04-28 10:09:01,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret17 := main(); {1106#true} is VALID [2022-04-28 10:09:01,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {1106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1111#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {1111#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1113#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:01,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {1107#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {1107#false} assume !(~y~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1107#false} assume !(~x~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1107#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1107#false} assume !(~z~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#false} assume !(~y~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L272 TraceCheckUtils]: 16: Hoare triple {1107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {1107#false} ~cond := #in~cond; {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {1107#false} assume 0 == ~cond; {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2022-04-28 10:09:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:01,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854146685] [2022-04-28 10:09:01,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854146685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:01,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591044423] [2022-04-28 10:09:01,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:01,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:01,319 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:09:01,323 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:09:01,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:01,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:01,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:09:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:01,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:01,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2022-04-28 10:09:01,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1106#true} is VALID [2022-04-28 10:09:01,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-28 10:09:01,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #94#return; {1106#true} is VALID [2022-04-28 10:09:01,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret17 := main(); {1106#true} is VALID [2022-04-28 10:09:01,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1111#(= main_~y~0 0)} is VALID [2022-04-28 10:09:01,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1111#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1142#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1142#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1142#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:01,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {1142#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:01,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1159#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:01,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {1159#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#false} assume !(~y~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,697 INFO L272 TraceCheckUtils]: 16: Hoare triple {1107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1107#false} is VALID [2022-04-28 10:09:01,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1107#false} ~cond := #in~cond; {1107#false} is VALID [2022-04-28 10:09:01,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {1107#false} assume 0 == ~cond; {1107#false} is VALID [2022-04-28 10:09:01,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2022-04-28 10:09:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:01,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:01,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2022-04-28 10:09:01,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1107#false} assume 0 == ~cond; {1107#false} is VALID [2022-04-28 10:09:01,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {1107#false} ~cond := #in~cond; {1107#false} is VALID [2022-04-28 10:09:01,836 INFO L272 TraceCheckUtils]: 16: Hoare triple {1107#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1107#false} is VALID [2022-04-28 10:09:01,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {1107#false} assume !(~y~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1193#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1107#false} is VALID [2022-04-28 10:09:01,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1193#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:01,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:01,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:01,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1197#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:01,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1207#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:01,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#true} ~z~0 := ~y~0; {1207#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:01,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#true} assume !(~x~0 % 4294967296 > 0); {1106#true} is VALID [2022-04-28 10:09:01,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1106#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret17 := main(); {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #94#return; {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1106#true} is VALID [2022-04-28 10:09:01,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2022-04-28 10:09:01,842 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:09:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591044423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:01,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:01,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-04-28 10:09:01,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:01,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019283870] [2022-04-28 10:09:01,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019283870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:01,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:01,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:09:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767761702] [2022-04-28 10:09:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:09:01,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:01,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09:01,859 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:09:01,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:09:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:01,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:09:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:01,860 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,104 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-04-28 10:09:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:09:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:09:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 10:09:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 10:09:02,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-28 10:09:02,164 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:09:02,166 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:09:02,166 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 10:09:02,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:09:02,168 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:02,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 10:09:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2022-04-28 10:09:02,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:02,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call 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,202 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call 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,202 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,203 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-28 10:09:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-04-28 10:09:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:02,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:02,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 10:09:02,204 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 10:09:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:02,207 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-28 10:09:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-04-28 10:09:02,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:02,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:02,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:02,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call 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,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-04-28 10:09:02,208 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2022-04-28 10:09:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:02,209 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-04-28 10:09:02,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09:02,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 60 transitions. [2022-04-28 10:09:02,262 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:09:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-04-28 10:09:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:09:02,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:02,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:02,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:09:02,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 10:09:02,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-28 10:09:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:02,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827488197] [2022-04-28 10:09:02,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:02,488 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 2 times [2022-04-28 10:09:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:02,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161666243] [2022-04-28 10:09:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:02,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {1581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-28 10:09:02,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 10:09:02,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1574#true} {1574#true} #94#return; {1574#true} is VALID [2022-04-28 10:09:02,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:02,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-28 10:09:02,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 10:09:02,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #94#return; {1574#true} is VALID [2022-04-28 10:09:02,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret17 := main(); {1574#true} is VALID [2022-04-28 10:09:02,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1574#true} is VALID [2022-04-28 10:09:02,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1574#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {1575#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {1575#false} assume !(~z~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {1575#false} assume !(~y~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L272 TraceCheckUtils]: 17: Hoare triple {1575#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {1575#false} ~cond := #in~cond; {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {1575#false} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 10:09:02,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 10:09:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:02,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161666243] [2022-04-28 10:09:02,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161666243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:02,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145046788] [2022-04-28 10:09:02,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:02,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:02,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:02,572 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:09:02,573 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:09:02,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:02,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:02,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:09:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:02,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:02,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 10:09:02,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-28 10:09:02,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 10:09:02,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #94#return; {1574#true} is VALID [2022-04-28 10:09:02,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret17 := main(); {1574#true} is VALID [2022-04-28 10:09:02,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1574#true} is VALID [2022-04-28 10:09:02,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {1574#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:02,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {1575#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {1575#false} assume !(~z~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1575#false} assume !(~y~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L272 TraceCheckUtils]: 17: Hoare triple {1575#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {1575#false} ~cond := #in~cond; {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {1575#false} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 10:09:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:02,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {1575#false} assume 0 == ~cond; {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {1575#false} ~cond := #in~cond; {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {1575#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {1575#false} assume !(~y~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {1575#false} assume !(~z~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:03,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1575#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1575#false} is VALID [2022-04-28 10:09:03,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1575#false} is VALID [2022-04-28 10:09:03,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:03,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:03,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:03,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1580#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:09:03,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:03,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:03,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {1574#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1579#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:03,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret17 := main(); {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #94#return; {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-28 10:09:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145046788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:03,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:03,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 10:09:03,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827488197] [2022-04-28 10:09:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827488197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:03,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:03,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:09:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747356626] [2022-04-28 10:09:03,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:09:03,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:03,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:09:03,139 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:09:03,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:09:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:09:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:09:03,140 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:09:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,348 INFO L93 Difference]: Finished difference Result 72 states and 101 transitions. [2022-04-28 10:09:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:09:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:09:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:09:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 10:09:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:09:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 10:09:03,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 10:09:03,388 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:09:03,389 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:09:03,389 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:09:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:09:03,390 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 35 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:09:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-04-28 10:09:03,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:03,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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:09:03,449 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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:09:03,449 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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:09:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,451 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-28 10:09:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-28 10:09:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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 64 states. [2022-04-28 10:09:03,451 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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 64 states. [2022-04-28 10:09:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:03,453 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-28 10:09:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-28 10:09:03,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:03,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:03,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:03,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 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:09:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2022-04-28 10:09:03,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 21 [2022-04-28 10:09:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:03,454 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2022-04-28 10:09:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:09:03,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 72 transitions. [2022-04-28 10:09:03,525 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:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2022-04-28 10:09:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:09:03,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:03,526 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:03,544 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:09:03,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-28 10:09:03,726 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1645264519, now seen corresponding path program 3 times [2022-04-28 10:09:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052974624] [2022-04-28 10:09:03,729 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:03,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1645264519, now seen corresponding path program 4 times [2022-04-28 10:09:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:03,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77444470] [2022-04-28 10:09:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {2094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2085#true} is VALID [2022-04-28 10:09:03,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2022-04-28 10:09:03,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #94#return; {2085#true} is VALID [2022-04-28 10:09:03,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:03,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2085#true} is VALID [2022-04-28 10:09:03,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2085#true} assume true; {2085#true} is VALID [2022-04-28 10:09:03,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2085#true} {2085#true} #94#return; {2085#true} is VALID [2022-04-28 10:09:03,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2085#true} call #t~ret17 := main(); {2085#true} is VALID [2022-04-28 10:09:03,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2090#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2090#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2091#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2093#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {2093#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {2086#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {2086#false} assume !(~x~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {2086#false} assume !(~z~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L272 TraceCheckUtils]: 17: Hoare triple {2086#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {2086#false} ~cond := #in~cond; {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {2086#false} assume 0 == ~cond; {2086#false} is VALID [2022-04-28 10:09:03,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2022-04-28 10:09:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77444470] [2022-04-28 10:09:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77444470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506983940] [2022-04-28 10:09:03,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:03,797 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:09:03,798 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:09:03,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:03,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:03,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:09:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:03,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:03,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2022-04-28 10:09:03,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2085#true} is VALID [2022-04-28 10:09:03,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2085#true} assume true; {2085#true} is VALID [2022-04-28 10:09:03,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2085#true} {2085#true} #94#return; {2085#true} is VALID [2022-04-28 10:09:03,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {2085#true} call #t~ret17 := main(); {2085#true} is VALID [2022-04-28 10:09:03,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2090#(= main_~y~0 0)} is VALID [2022-04-28 10:09:03,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {2090#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2091#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:03,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {2091#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {2092#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2125#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {2125#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {2086#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {2086#false} assume !(~x~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {2086#false} assume !(~z~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {2086#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2086#false} is VALID [2022-04-28 10:09:03,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {2086#false} ~cond := #in~cond; {2086#false} is VALID [2022-04-28 10:09:03,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {2086#false} assume 0 == ~cond; {2086#false} is VALID [2022-04-28 10:09:03,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2022-04-28 10:09:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:03,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {2086#false} assume 0 == ~cond; {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {2086#false} ~cond := #in~cond; {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L272 TraceCheckUtils]: 17: Hoare triple {2086#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2086#false} assume !(~z~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2086#false} assume !(~x~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {2086#false} assume !(~y~0 % 4294967296 > 0); {2086#false} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {2186#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2086#false} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {2190#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2186#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {2085#true} ~z~0 := ~y~0; {2190#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {2085#true} assume !(~x~0 % 4294967296 > 0); {2085#true} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {2085#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2085#true} is VALID [2022-04-28 10:09:03,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {2085#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2085#true} is VALID [2022-04-28 10:09:03,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2085#true} is VALID [2022-04-28 10:09:03,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {2085#true} call #t~ret17 := main(); {2085#true} is VALID [2022-04-28 10:09:03,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2085#true} {2085#true} #94#return; {2085#true} is VALID [2022-04-28 10:09:03,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2085#true} assume true; {2085#true} is VALID [2022-04-28 10:09:03,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2085#true} is VALID [2022-04-28 10:09:03,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2022-04-28 10:09:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:09:03,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506983940] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:03,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:09:03,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 10 [2022-04-28 10:09:03,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:03,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052974624] [2022-04-28 10:09:03,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052974624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:03,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:03,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638766073] [2022-04-28 10:09:03,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 21 [2022-04-28 10:09:03,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:03,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:03,990 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:09:03,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:09:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:03,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:09:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:03,991 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,084 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2022-04-28 10:09:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:09:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 21 [2022-04-28 10:09:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-28 10:09:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-28 10:09:04,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-28 10:09:04,107 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:04,108 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:09:04,108 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:09:04,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:04,109 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:04,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:09:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-28 10:09:04,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:04,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,162 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,166 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,167 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 10:09:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 10:09:04,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states 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:09:04,168 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states 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:09:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:04,169 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 10:09:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-28 10:09:04,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:04,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:04,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:04,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2022-04-28 10:09:04,171 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 21 [2022-04-28 10:09:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:04,171 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2022-04-28 10:09:04,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:04,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 67 transitions. [2022-04-28 10:09:04,243 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:09:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-04-28 10:09:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:09:04,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:04,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:04,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 10:09:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:04,458 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-28 10:09:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286822014] [2022-04-28 10:09:04,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:04,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 2 times [2022-04-28 10:09:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:04,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398783405] [2022-04-28 10:09:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:04,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {2547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:09:04,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:09:04,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #94#return; {2537#true} is VALID [2022-04-28 10:09:04,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:04,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:09:04,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:09:04,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #94#return; {2537#true} is VALID [2022-04-28 10:09:04,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret17 := main(); {2537#true} is VALID [2022-04-28 10:09:04,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID [2022-04-28 10:09:04,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {2544#(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; {2545#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:04,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {2545#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2545#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:04,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2545#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L272 TraceCheckUtils]: 18: Hoare triple {2538#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:09:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:04,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398783405] [2022-04-28 10:09:04,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398783405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:04,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891034863] [2022-04-28 10:09:04,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:04,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:04,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:04,548 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:09:04,549 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:09:04,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:04,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:04,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:09:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:04,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:04,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2022-04-28 10:09:04,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:09:04,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:09:04,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #94#return; {2537#true} is VALID [2022-04-28 10:09:04,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret17 := main(); {2537#true} is VALID [2022-04-28 10:09:04,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID [2022-04-28 10:09:04,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2575#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {2575#(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; {2579#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {2579#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {2579#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:04,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {2579#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:04,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {2544#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L272 TraceCheckUtils]: 18: Hoare triple {2538#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:09:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:04,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:04,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L272 TraceCheckUtils]: 18: Hoare triple {2538#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2538#false} is VALID [2022-04-28 10:09:04,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {2634#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:09:04,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {2634#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:04,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {2634#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:04,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {2634#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:04,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {2647#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:04,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {2647#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2647#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:04,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {2654#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {2647#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:04,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {2537#true} ~z~0 := ~y~0; {2654#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:04,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#true} assume !(~x~0 % 4294967296 > 0); {2537#true} is VALID [2022-04-28 10:09:04,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret17 := main(); {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #94#return; {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2022-04-28 10:09:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:04,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891034863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:04,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:04,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-28 10:09:04,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:04,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286822014] [2022-04-28 10:09:04,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286822014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:04,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:04,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:09:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824970760] [2022-04-28 10:09:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:09:04,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:04,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:04,947 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:09:04,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:09:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:09:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:04,948 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:05,314 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2022-04-28 10:09:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:05,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:09:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-28 10:09:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-28 10:09:05,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-28 10:09:05,365 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:09:05,366 INFO L225 Difference]: With dead ends: 72 [2022-04-28 10:09:05,366 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:09:05,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:05,367 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:05,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 43 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:09:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 10:09:05,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:05,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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:09:05,432 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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:09:05,432 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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:09:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:05,433 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-28 10:09:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2022-04-28 10:09:05,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:05,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:05,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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 52 states. [2022-04-28 10:09:05,433 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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 52 states. [2022-04-28 10:09:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:05,438 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-28 10:09:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2022-04-28 10:09:05,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:05,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:05,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:05,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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:09:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-28 10:09:05,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-28 10:09:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:05,440 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-28 10:09:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:05,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-28 10:09:05,506 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:09:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-28 10:09:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:09:05,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:05,507 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:05,525 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:09:05,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,719 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2082007595, now seen corresponding path program 1 times [2022-04-28 10:09:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:05,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195097523] [2022-04-28 10:09:05,722 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:05,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2082007595, now seen corresponding path program 2 times [2022-04-28 10:09:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:05,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187398509] [2022-04-28 10:09:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3044#true} is VALID [2022-04-28 10:09:05,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-28 10:09:05,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3044#true} {3044#true} #94#return; {3044#true} is VALID [2022-04-28 10:09:05,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:05,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3044#true} is VALID [2022-04-28 10:09:05,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-28 10:09:05,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #94#return; {3044#true} is VALID [2022-04-28 10:09:05,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret17 := main(); {3044#true} is VALID [2022-04-28 10:09:05,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3049#(= main_~y~0 0)} is VALID [2022-04-28 10:09:05,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:05,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:05,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3052#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:05,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {3052#(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; {3053#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {3053#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#false} assume !(~y~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {3045#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {3045#false} assume !(~x~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {3045#false} assume !(~z~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {3045#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {3045#false} assume !(~y~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L272 TraceCheckUtils]: 18: Hoare triple {3045#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#false} ~cond := #in~cond; {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#false} assume 0 == ~cond; {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-28 10:09:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:05,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187398509] [2022-04-28 10:09:05,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187398509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786589562] [2022-04-28 10:09:05,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:05,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:05,804 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:09:05,805 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:09:05,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:05,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:05,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:05,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:06,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-28 10:09:06,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3044#true} is VALID [2022-04-28 10:09:06,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-28 10:09:06,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #94#return; {3044#true} is VALID [2022-04-28 10:09:06,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret17 := main(); {3044#true} is VALID [2022-04-28 10:09:06,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3049#(= main_~y~0 0)} is VALID [2022-04-28 10:09:06,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:06,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3085#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {3085#(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; {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:06,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3098#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:06,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {3051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:06,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {3045#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3045#false} is VALID [2022-04-28 10:09:06,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#false} ~cond := #in~cond; {3045#false} is VALID [2022-04-28 10:09:06,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#false} assume 0 == ~cond; {3045#false} is VALID [2022-04-28 10:09:06,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-28 10:09:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:06,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:06,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-28 10:09:06,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#false} assume 0 == ~cond; {3045#false} is VALID [2022-04-28 10:09:06,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#false} ~cond := #in~cond; {3045#false} is VALID [2022-04-28 10:09:06,168 INFO L272 TraceCheckUtils]: 18: Hoare triple {3045#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3045#false} is VALID [2022-04-28 10:09:06,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {3135#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3045#false} is VALID [2022-04-28 10:09:06,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3135#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:06,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:06,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:06,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {3135#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3139#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:06,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {3135#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3135#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:06,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3135#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3135#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {3158#(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; {3135#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} ~z~0 := ~y~0; {3158#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} assume !(~x~0 % 4294967296 > 0); {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {3044#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret17 := main(); {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #94#return; {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-28 10:09:06,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3044#true} is VALID [2022-04-28 10:09:06,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-28 10:09:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:09:06,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786589562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:06,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:06,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-28 10:09:06,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:06,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195097523] [2022-04-28 10:09:06,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195097523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:06,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:06,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:09:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638880804] [2022-04-28 10:09:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:09:06,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:06,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:06,188 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:09:06,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:09:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:09:06,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:06,188 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,635 INFO L93 Difference]: Finished difference Result 96 states and 139 transitions. [2022-04-28 10:09:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:06,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:09:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-04-28 10:09:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-04-28 10:09:06,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2022-04-28 10:09:06,692 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:06,693 INFO L225 Difference]: With dead ends: 96 [2022-04-28 10:09:06,693 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 10:09:06,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:06,694 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:06,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 50 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 10:09:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-04-28 10:09:06,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:06,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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:09:06,791 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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:09:06,791 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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:09:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,792 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-04-28 10:09:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-04-28 10:09:06,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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 75 states. [2022-04-28 10:09:06,792 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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 75 states. [2022-04-28 10:09:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:06,793 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-04-28 10:09:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-04-28 10:09:06,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:06,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:06,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:06,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 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:09:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2022-04-28 10:09:06,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 22 [2022-04-28 10:09:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:06,795 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2022-04-28 10:09:06,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:09:06,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 89 transitions. [2022-04-28 10:09:06,891 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:09:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-04-28 10:09:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:09:06,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:06,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:06,907 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:09:07,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:09:07,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-28 10:09:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639978861] [2022-04-28 10:09:07,098 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:07,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 2 times [2022-04-28 10:09:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:07,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114190257] [2022-04-28 10:09:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3675#true} is VALID [2022-04-28 10:09:07,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {3675#true} assume true; {3675#true} is VALID [2022-04-28 10:09:07,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3675#true} {3675#true} #94#return; {3675#true} is VALID [2022-04-28 10:09:07,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {3675#true} call ULTIMATE.init(); {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:07,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {3684#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3675#true} is VALID [2022-04-28 10:09:07,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {3675#true} assume true; {3675#true} is VALID [2022-04-28 10:09:07,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3675#true} {3675#true} #94#return; {3675#true} is VALID [2022-04-28 10:09:07,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {3675#true} call #t~ret17 := main(); {3675#true} is VALID [2022-04-28 10:09:07,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {3675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3675#true} is VALID [2022-04-28 10:09:07,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {3675#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3675#true} is VALID [2022-04-28 10:09:07,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {3675#true} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {3680#(<= (* (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; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3682#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:07,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {3682#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3683#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:07,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {3683#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3676#false} is VALID [2022-04-28 10:09:07,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {3676#false} assume !false; {3676#false} is VALID [2022-04-28 10:09:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114190257] [2022-04-28 10:09:07,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114190257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:07,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289581304] [2022-04-28 10:09:07,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:07,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:07,248 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:09:07,249 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:09:07,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:07,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:07,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:07,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:07,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {3675#true} call ULTIMATE.init(); {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {3675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {3675#true} assume true; {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3675#true} {3675#true} #94#return; {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {3675#true} call #t~ret17 := main(); {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {3675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3675#true} is VALID [2022-04-28 10:09:07,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {3675#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3675#true} is VALID [2022-04-28 10:09:07,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {3675#true} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {3680#(<= (* (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; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:07,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:07,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3676#false} is VALID [2022-04-28 10:09:07,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {3676#false} assume !false; {3676#false} is VALID [2022-04-28 10:09:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:07,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:07,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {3676#false} assume !false; {3676#false} is VALID [2022-04-28 10:09:07,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3676#false} is VALID [2022-04-28 10:09:07,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:07,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:07,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {3680#(<= (* (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; {3681#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:07,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {3675#true} assume !(~x~0 % 4294967296 > 0); {3680#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:07,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {3675#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {3675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {3675#true} call #t~ret17 := main(); {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3675#true} {3675#true} #94#return; {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3675#true} assume true; {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3675#true} is VALID [2022-04-28 10:09:07,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {3675#true} call ULTIMATE.init(); {3675#true} is VALID [2022-04-28 10:09:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:07,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289581304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:07,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:07,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 10:09:07,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:07,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639978861] [2022-04-28 10:09:07,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639978861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:07,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:07,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228962679] [2022-04-28 10:09:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:09:07,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:07,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 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:09:07,723 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:09:07,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:09:07,724 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 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:09:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,087 INFO L93 Difference]: Finished difference Result 101 states and 139 transitions. [2022-04-28 10:09:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 10:09:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 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:09:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 10:09:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 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:09:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 10:09:08,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-28 10:09:08,130 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:09:08,131 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:09:08,131 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 10:09:08,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 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:09:08,132 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:08,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 10:09:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-04-28 10:09:08,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:08,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call 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:08,216 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call 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:08,216 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call 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:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,217 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2022-04-28 10:09:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-04-28 10:09:08,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 10:09:08,217 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 10:09:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:08,218 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2022-04-28 10:09:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-04-28 10:09:08,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:08,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:08,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:08,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call 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:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-28 10:09:08,219 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 23 [2022-04-28 10:09:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:08,219 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-28 10:09:08,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 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:09:08,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 80 transitions. [2022-04-28 10:09:08,325 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:09:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-28 10:09:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:09:08,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:08,326 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:08,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 10:09:08,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:08,527 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1156754328, now seen corresponding path program 3 times [2022-04-28 10:09:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:08,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091312569] [2022-04-28 10:09:08,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:08,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1156754328, now seen corresponding path program 4 times [2022-04-28 10:09:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:08,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734907651] [2022-04-28 10:09:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {4291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-28 10:09:08,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-28 10:09:08,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-28 10:09:08,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:08,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {4291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-28 10:09:08,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-28 10:09:08,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-28 10:09:08,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {4280#true} call #t~ret17 := main(); {4280#true} is VALID [2022-04-28 10:09:08,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4285#(= main_~y~0 0)} is VALID [2022-04-28 10:09:08,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4286#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:08,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {4286#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4287#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:08,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {4287#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4289#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {4289#(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; {4290#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {4290#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {4281#false} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {4281#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {4281#false} assume !(~x~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {4281#false} assume !(~z~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {4281#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4281#false} is VALID [2022-04-28 10:09:08,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {4281#false} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,660 INFO L272 TraceCheckUtils]: 19: Hoare triple {4281#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4281#false} is VALID [2022-04-28 10:09:08,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {4281#false} ~cond := #in~cond; {4281#false} is VALID [2022-04-28 10:09:08,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {4281#false} assume 0 == ~cond; {4281#false} is VALID [2022-04-28 10:09:08,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-28 10:09:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734907651] [2022-04-28 10:09:08,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734907651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218182862] [2022-04-28 10:09:08,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:08,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:08,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:08,680 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:09:08,680 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:09:08,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:08,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:08,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:09:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:08,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:08,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-28 10:09:08,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-28 10:09:08,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-28 10:09:08,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-28 10:09:08,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {4280#true} call #t~ret17 := main(); {4280#true} is VALID [2022-04-28 10:09:08,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4285#(= main_~y~0 0)} is VALID [2022-04-28 10:09:08,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {4285#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4286#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:08,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {4286#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4287#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:08,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {4287#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4325#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {4325#(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; {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {4281#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4281#false} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {4281#false} assume !(~x~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {4281#false} assume !(~z~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {4281#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4281#false} is VALID [2022-04-28 10:09:08,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {4281#false} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:08,930 INFO L272 TraceCheckUtils]: 19: Hoare triple {4281#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4281#false} is VALID [2022-04-28 10:09:08,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {4281#false} ~cond := #in~cond; {4281#false} is VALID [2022-04-28 10:09:08,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {4281#false} assume 0 == ~cond; {4281#false} is VALID [2022-04-28 10:09:08,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-28 10:09:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:08,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {4281#false} assume 0 == ~cond; {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {4281#false} ~cond := #in~cond; {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {4281#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {4281#false} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {4281#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {4281#false} assume !(~z~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {4281#false} assume !(~x~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {4281#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4281#false} is VALID [2022-04-28 10:09:09,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {4389#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4281#false} is VALID [2022-04-28 10:09:09,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {4389#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {4396#(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; {4389#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:09,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {4280#true} ~z~0 := ~y~0; {4396#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {4280#true} assume !(~x~0 % 4294967296 > 0); {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {4280#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {4280#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {4280#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {4280#true} call #t~ret17 := main(); {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-28 10:09:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:09:09,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218182862] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:09,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:09:09,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 7] total 12 [2022-04-28 10:09:09,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091312569] [2022-04-28 10:09:09,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091312569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:09,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:09,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:09:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474164047] [2022-04-28 10:09:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2022-04-28 10:09:09,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:09,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:09:09,018 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:09:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:09:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:09:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:09,019 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:09:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,160 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-04-28 10:09:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:09:09,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2022-04-28 10:09:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:09:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 10:09:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:09:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 10:09:09,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 10:09:09,184 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:09:09,184 INFO L225 Difference]: With dead ends: 69 [2022-04-28 10:09:09,184 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:09:09,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:09,185 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:09,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:09:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:09:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-04-28 10:09:09,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:09,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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:09:09,266 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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:09:09,266 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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:09:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,267 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-28 10:09:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 10:09:09,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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 57 states. [2022-04-28 10:09:09,267 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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 57 states. [2022-04-28 10:09:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:09,268 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-28 10:09:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 10:09:09,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:09,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:09,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:09,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 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:09:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-04-28 10:09:09,269 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2022-04-28 10:09:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:09,269 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-04-28 10:09:09,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:09:09,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 72 transitions. [2022-04-28 10:09:09,350 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,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-28 10:09:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:09:09,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:09,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:09,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:09,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:09,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:09,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 489571588, now seen corresponding path program 3 times [2022-04-28 10:09:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [48482658] [2022-04-28 10:09:09,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:09,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 489571588, now seen corresponding path program 4 times [2022-04-28 10:09:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:09,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041599988] [2022-04-28 10:09:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {4800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4788#true} assume true; {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4788#true} {4788#true} #94#return; {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {4788#true} call ULTIMATE.init(); {4800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:09,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {4788#true} assume true; {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4788#true} {4788#true} #94#return; {4788#true} is VALID [2022-04-28 10:09:09,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {4788#true} call #t~ret17 := main(); {4788#true} is VALID [2022-04-28 10:09:09,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {4788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4793#(= main_~y~0 0)} is VALID [2022-04-28 10:09:09,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {4793#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:09,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {4794#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {4795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:09,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:09,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {4796#(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; {4797#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:09,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {4797#(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; {4798#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:09,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {4798#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4798#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:09,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {4798#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4797#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:09,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:09,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:09,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {4796#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4799#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {4799#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#false} assume !(~y~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L272 TraceCheckUtils]: 20: Hoare triple {4789#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {4789#false} ~cond := #in~cond; {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {4789#false} assume 0 == ~cond; {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#false} assume !false; {4789#false} is VALID [2022-04-28 10:09:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041599988] [2022-04-28 10:09:09,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041599988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:09,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583462080] [2022-04-28 10:09:09,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:09,668 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:09:09,669 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:09:09,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:09,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:09,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:09:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:09,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:09,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {4788#true} call ULTIMATE.init(); {4788#true} is VALID [2022-04-28 10:09:09,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {4788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4788#true} is VALID [2022-04-28 10:09:09,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {4788#true} assume true; {4788#true} is VALID [2022-04-28 10:09:09,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4788#true} {4788#true} #94#return; {4788#true} is VALID [2022-04-28 10:09:09,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {4788#true} call #t~ret17 := main(); {4788#true} is VALID [2022-04-28 10:09:09,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {4788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4788#true} is VALID [2022-04-28 10:09:09,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {4788#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {4822#(< 0 (mod (+ main_~x~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; {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {4789#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4789#false} is VALID [2022-04-28 10:09:09,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#false} assume !(~z~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#false} assume !(~y~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L272 TraceCheckUtils]: 20: Hoare triple {4789#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {4789#false} ~cond := #in~cond; {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {4789#false} assume 0 == ~cond; {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#false} assume !false; {4789#false} is VALID [2022-04-28 10:09:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:09:09,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:09,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#false} assume !false; {4789#false} is VALID [2022-04-28 10:09:09,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {4789#false} assume 0 == ~cond; {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {4789#false} ~cond := #in~cond; {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L272 TraceCheckUtils]: 20: Hoare triple {4789#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#false} assume !(~y~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#false} assume !(~z~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {4789#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4789#false} is VALID [2022-04-28 10:09:09,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {4839#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4839#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:09,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {4822#(< 0 (mod (+ main_~x~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; {4826#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:09,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {4788#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4822#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:09,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4788#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4788#true} is VALID [2022-04-28 10:09:09,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {4788#true} call #t~ret17 := main(); {4788#true} is VALID [2022-04-28 10:09:09,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4788#true} {4788#true} #94#return; {4788#true} is VALID [2022-04-28 10:09:09,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4788#true} assume true; {4788#true} is VALID [2022-04-28 10:09:09,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4788#true} is VALID [2022-04-28 10:09:09,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {4788#true} call ULTIMATE.init(); {4788#true} is VALID [2022-04-28 10:09:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:09:09,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583462080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:09,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:09,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-28 10:09:09,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:09,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [48482658] [2022-04-28 10:09:09,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [48482658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:09,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:09,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:09,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638561980] [2022-04-28 10:09:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:09:09,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:09,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:09:09,900 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:09:09,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:09,900 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:09:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,625 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2022-04-28 10:09:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:09:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:09:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:09:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. [2022-04-28 10:09:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:09:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 86 transitions. [2022-04-28 10:09:10,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 86 transitions. [2022-04-28 10:09:10,706 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:09:10,707 INFO L225 Difference]: With dead ends: 93 [2022-04-28 10:09:10,707 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 10:09:10,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:10,708 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:10,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 10:09:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-04-28 10:09:10,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:10,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call 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,830 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call 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,831 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call 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,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,831 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-28 10:09:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-28 10:09:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states 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:09:10,832 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states 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:09:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:10,833 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-28 10:09:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-28 10:09:10,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:10,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:10,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:10,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call 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,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-04-28 10:09:10,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 24 [2022-04-28 10:09:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:10,834 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-04-28 10:09:10,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:09:10,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 78 transitions. [2022-04-28 10:09:10,936 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:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-04-28 10:09:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:09:10,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:10,937 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:10,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 10:09:11,143 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,SelfDestructingSolverStorable12 [2022-04-28 10:09:11,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 531281669, now seen corresponding path program 3 times [2022-04-28 10:09:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953259425] [2022-04-28 10:09:11,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:11,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash 531281669, now seen corresponding path program 4 times [2022-04-28 10:09:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:11,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424473401] [2022-04-28 10:09:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {5426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5415#true} is VALID [2022-04-28 10:09:11,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {5415#true} assume true; {5415#true} is VALID [2022-04-28 10:09:11,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5415#true} {5415#true} #94#return; {5415#true} is VALID [2022-04-28 10:09:11,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {5415#true} call ULTIMATE.init(); {5426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:11,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {5426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5415#true} is VALID [2022-04-28 10:09:11,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {5415#true} assume true; {5415#true} is VALID [2022-04-28 10:09:11,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5415#true} {5415#true} #94#return; {5415#true} is VALID [2022-04-28 10:09:11,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {5415#true} call #t~ret17 := main(); {5415#true} is VALID [2022-04-28 10:09:11,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {5415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5420#(= main_~y~0 0)} is VALID [2022-04-28 10:09:11,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {5420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:11,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {5421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:11,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {5422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:11,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {5424#(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; {5425#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {5425#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {5416#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {5416#false} assume !(~y~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {5416#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {5416#false} assume !(~x~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {5416#false} assume !(~z~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {5416#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {5416#false} assume !(~y~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L272 TraceCheckUtils]: 20: Hoare triple {5416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {5416#false} ~cond := #in~cond; {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {5416#false} assume 0 == ~cond; {5416#false} is VALID [2022-04-28 10:09:11,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {5416#false} assume !false; {5416#false} is VALID [2022-04-28 10:09:11,248 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:09:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424473401] [2022-04-28 10:09:11,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424473401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549766505] [2022-04-28 10:09:11,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:11,249 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:09:11,250 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:09:11,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:11,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:11,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:09:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:11,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:11,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {5415#true} call ULTIMATE.init(); {5415#true} is VALID [2022-04-28 10:09:11,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {5415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5415#true} is VALID [2022-04-28 10:09:11,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {5415#true} assume true; {5415#true} is VALID [2022-04-28 10:09:11,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5415#true} {5415#true} #94#return; {5415#true} is VALID [2022-04-28 10:09:11,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {5415#true} call #t~ret17 := main(); {5415#true} is VALID [2022-04-28 10:09:11,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {5415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5420#(= main_~y~0 0)} is VALID [2022-04-28 10:09:11,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {5420#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:11,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {5421#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:11,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {5422#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {5423#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5460#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:11,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {5460#(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; {5464#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:11,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {5464#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5464#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:11,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {5464#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:11,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:11,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:11,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:11,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {5424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {5416#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {5416#false} is VALID [2022-04-28 10:09:11,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {5416#false} assume !(~y~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,529 INFO L272 TraceCheckUtils]: 20: Hoare triple {5416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5416#false} is VALID [2022-04-28 10:09:11,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {5416#false} ~cond := #in~cond; {5416#false} is VALID [2022-04-28 10:09:11,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {5416#false} assume 0 == ~cond; {5416#false} is VALID [2022-04-28 10:09:11,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {5416#false} assume !false; {5416#false} is VALID [2022-04-28 10:09:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:09:11,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:11,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {5416#false} assume !false; {5416#false} is VALID [2022-04-28 10:09:11,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {5416#false} assume 0 == ~cond; {5416#false} is VALID [2022-04-28 10:09:11,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {5416#false} ~cond := #in~cond; {5416#false} is VALID [2022-04-28 10:09:11,636 INFO L272 TraceCheckUtils]: 20: Hoare triple {5416#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5416#false} is VALID [2022-04-28 10:09:11,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {5416#false} assume !(~y~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {5416#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {5416#false} is VALID [2022-04-28 10:09:11,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {5519#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5416#false} is VALID [2022-04-28 10:09:11,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {5519#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:11,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {5519#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:11,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {5519#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:11,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {5532#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:11,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {5532#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5532#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {5539#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {5532#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {5415#true} ~z~0 := ~y~0; {5539#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {5415#true} assume !(~x~0 % 4294967296 > 0); {5415#true} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {5415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5415#true} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {5415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5415#true} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {5415#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5415#true} is VALID [2022-04-28 10:09:11,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {5415#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {5415#true} call #t~ret17 := main(); {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5415#true} {5415#true} #94#return; {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {5415#true} assume true; {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {5415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {5415#true} call ULTIMATE.init(); {5415#true} is VALID [2022-04-28 10:09:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:09:11,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549766505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:11,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:11,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 14 [2022-04-28 10:09:11,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:11,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953259425] [2022-04-28 10:09:11,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953259425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:11,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:11,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41984586] [2022-04-28 10:09:11,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:09:11,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:11,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:09:11,657 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:09:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:09:11,658 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:09:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,320 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2022-04-28 10:09:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:09:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:09:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:09:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-28 10:09:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:09:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-28 10:09:12,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2022-04-28 10:09:12,394 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:12,395 INFO L225 Difference]: With dead ends: 123 [2022-04-28 10:09:12,395 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 10:09:12,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:12,396 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:12,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 10:09:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2022-04-28 10:09:12,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:12,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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:09:12,559 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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:09:12,559 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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:09:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,560 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-28 10:09:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-28 10:09:12,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:12,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:12,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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 100 states. [2022-04-28 10:09:12,561 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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 100 states. [2022-04-28 10:09:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:12,562 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-28 10:09:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-28 10:09:12,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:12,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:12,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:12,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 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:09:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2022-04-28 10:09:12,563 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 24 [2022-04-28 10:09:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:12,563 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2022-04-28 10:09:12,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:09:12,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 112 transitions. [2022-04-28 10:09:12,701 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:09:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2022-04-28 10:09:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:12,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:12,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:12,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 10:09:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:09:12,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 5 times [2022-04-28 10:09:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:12,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463735564] [2022-04-28 10:09:12,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:12,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash -565826439, now seen corresponding path program 6 times [2022-04-28 10:09:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:12,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247185030] [2022-04-28 10:09:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:12,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {6212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6203#true} is VALID [2022-04-28 10:09:12,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6203#true} assume true; {6203#true} is VALID [2022-04-28 10:09:12,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6203#true} {6203#true} #94#return; {6203#true} is VALID [2022-04-28 10:09:12,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {6203#true} call ULTIMATE.init(); {6212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:12,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {6212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6203#true} is VALID [2022-04-28 10:09:12,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {6203#true} assume true; {6203#true} is VALID [2022-04-28 10:09:12,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6203#true} {6203#true} #94#return; {6203#true} is VALID [2022-04-28 10:09:12,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {6203#true} call #t~ret17 := main(); {6203#true} is VALID [2022-04-28 10:09:12,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {6203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6203#true} is VALID [2022-04-28 10:09:12,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {6203#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:12,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:12,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:12,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:09:12,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {6209#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6210#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:12,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {6210#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:12,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:12,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:12,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:12,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:12,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {6211#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:12,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {6204#false} assume !(~z~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {6204#false} assume !(~y~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L272 TraceCheckUtils]: 21: Hoare triple {6204#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {6204#false} ~cond := #in~cond; {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {6204#false} assume 0 == ~cond; {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {6204#false} assume !false; {6204#false} is VALID [2022-04-28 10:09:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:12,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247185030] [2022-04-28 10:09:12,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247185030] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:12,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180451040] [2022-04-28 10:09:12,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:12,981 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:09:12,982 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:09:13,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:09:13,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:13,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:09:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:13,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:13,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {6203#true} call ULTIMATE.init(); {6203#true} is VALID [2022-04-28 10:09:13,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {6203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6203#true} is VALID [2022-04-28 10:09:13,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {6203#true} assume true; {6203#true} is VALID [2022-04-28 10:09:13,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6203#true} {6203#true} #94#return; {6203#true} is VALID [2022-04-28 10:09:13,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {6203#true} call #t~ret17 := main(); {6203#true} is VALID [2022-04-28 10:09:13,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {6203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6203#true} is VALID [2022-04-28 10:09:13,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {6203#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:13,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:13,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {6204#false} assume !(~z~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {6204#false} assume !(~y~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L272 TraceCheckUtils]: 21: Hoare triple {6204#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {6204#false} ~cond := #in~cond; {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {6204#false} assume 0 == ~cond; {6204#false} is VALID [2022-04-28 10:09:13,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {6204#false} assume !false; {6204#false} is VALID [2022-04-28 10:09:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:13,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:13,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {6204#false} assume !false; {6204#false} is VALID [2022-04-28 10:09:13,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {6204#false} assume 0 == ~cond; {6204#false} is VALID [2022-04-28 10:09:13,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {6204#false} ~cond := #in~cond; {6204#false} is VALID [2022-04-28 10:09:13,587 INFO L272 TraceCheckUtils]: 21: Hoare triple {6204#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6204#false} is VALID [2022-04-28 10:09:13,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {6204#false} assume !(~y~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {6204#false} assume !(~z~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:13,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6204#false} is VALID [2022-04-28 10:09:13,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6204#false} is VALID [2022-04-28 10:09:13,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6250#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:13,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:13,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6237#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:13,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {6203#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6208#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:13,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {6203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6203#true} is VALID [2022-04-28 10:09:13,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {6203#true} call #t~ret17 := main(); {6203#true} is VALID [2022-04-28 10:09:13,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6203#true} {6203#true} #94#return; {6203#true} is VALID [2022-04-28 10:09:13,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {6203#true} assume true; {6203#true} is VALID [2022-04-28 10:09:13,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6203#true} is VALID [2022-04-28 10:09:13,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6203#true} call ULTIMATE.init(); {6203#true} is VALID [2022-04-28 10:09:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:09:13,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180451040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:13,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:13,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 10:09:13,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463735564] [2022-04-28 10:09:13,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463735564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:13,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:13,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:09:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909095731] [2022-04-28 10:09:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:13,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:09:13,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:13,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:09:13,614 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:09:13,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:09:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:09:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:09:13,614 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:09:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,162 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2022-04-28 10:09:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:09:14,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:09:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:09:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 10:09:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:09:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 10:09:14,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 10:09:14,218 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:09:14,219 INFO L225 Difference]: With dead ends: 143 [2022-04-28 10:09:14,219 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 10:09:14,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:09:14,220 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:14,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 10:09:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-04-28 10:09:14,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:14,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call 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:14,407 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call 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:14,407 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call 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:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,409 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2022-04-28 10:09:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-04-28 10:09:14,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:14,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:14,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states 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:09:14,409 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states 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:09:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:14,410 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2022-04-28 10:09:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 162 transitions. [2022-04-28 10:09:14,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:14,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:14,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:14,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call 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:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2022-04-28 10:09:14,412 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 25 [2022-04-28 10:09:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:14,412 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2022-04-28 10:09:14,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:09:14,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 119 transitions. [2022-04-28 10:09:14,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2022-04-28 10:09:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:09:14,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:14,637 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:14,653 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:09:14,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,SelfDestructingSolverStorable14 [2022-04-28 10:09:14,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -869799928, now seen corresponding path program 5 times [2022-04-28 10:09:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864360828] [2022-04-28 10:09:14,840 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:14,840 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -869799928, now seen corresponding path program 6 times [2022-04-28 10:09:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:14,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096571603] [2022-04-28 10:09:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:14,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:14,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {7088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {7076#true} assume true; {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7076#true} {7076#true} #94#return; {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {7076#true} call ULTIMATE.init(); {7088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:14,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {7088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {7076#true} assume true; {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7076#true} {7076#true} #94#return; {7076#true} is VALID [2022-04-28 10:09:14,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {7076#true} call #t~ret17 := main(); {7076#true} is VALID [2022-04-28 10:09:14,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {7076#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7081#(= main_~y~0 0)} is VALID [2022-04-28 10:09:14,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {7081#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7082#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:14,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {7082#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7083#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:14,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {7083#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7084#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:14,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {7084#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:14,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:14,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7086#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {7086#(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; {7087#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {7087#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {7077#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {7077#false} assume !(~x~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {7077#false} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:14,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7077#false} is VALID [2022-04-28 10:09:14,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:14,963 INFO L272 TraceCheckUtils]: 21: Hoare triple {7077#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7077#false} is VALID [2022-04-28 10:09:14,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {7077#false} ~cond := #in~cond; {7077#false} is VALID [2022-04-28 10:09:14,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {7077#false} assume 0 == ~cond; {7077#false} is VALID [2022-04-28 10:09:14,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {7077#false} assume !false; {7077#false} is VALID [2022-04-28 10:09:14,963 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:09:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096571603] [2022-04-28 10:09:14,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096571603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327949789] [2022-04-28 10:09:14,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:14,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:14,964 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:09:14,965 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:09:14,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:14,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:14,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:09:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:15,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:15,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {7076#true} call ULTIMATE.init(); {7076#true} is VALID [2022-04-28 10:09:15,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {7076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7076#true} is VALID [2022-04-28 10:09:15,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {7076#true} assume true; {7076#true} is VALID [2022-04-28 10:09:15,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7076#true} {7076#true} #94#return; {7076#true} is VALID [2022-04-28 10:09:15,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {7076#true} call #t~ret17 := main(); {7076#true} is VALID [2022-04-28 10:09:15,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {7076#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7081#(= main_~y~0 0)} is VALID [2022-04-28 10:09:15,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {7081#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7082#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:15,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {7082#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7083#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:15,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {7083#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7084#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:15,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {7084#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:15,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:15,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {7085#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7086#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {7086#(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; {7128#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {7128#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {7077#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {7077#false} assume !(~x~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {7077#false} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7077#false} is VALID [2022-04-28 10:09:15,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,172 INFO L272 TraceCheckUtils]: 21: Hoare triple {7077#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7077#false} is VALID [2022-04-28 10:09:15,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {7077#false} ~cond := #in~cond; {7077#false} is VALID [2022-04-28 10:09:15,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {7077#false} assume 0 == ~cond; {7077#false} is VALID [2022-04-28 10:09:15,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {7077#false} assume !false; {7077#false} is VALID [2022-04-28 10:09:15,172 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:09:15,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {7077#false} assume !false; {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {7077#false} assume 0 == ~cond; {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {7077#false} ~cond := #in~cond; {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L272 TraceCheckUtils]: 21: Hoare triple {7077#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {7077#false} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {7077#false} assume !(~x~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {7077#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#false} assume !(~y~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {7077#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7077#false} is VALID [2022-04-28 10:09:15,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {7198#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7077#false} is VALID [2022-04-28 10:09:15,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {7202#(< 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; {7198#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:15,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {7206#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {7202#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:15,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {7206#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {7206#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:15,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {7213#(< 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; {7206#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:15,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7217#(< 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; {7213#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:15,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {7221#(< 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; {7217#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:15,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {7225#(< 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; {7221#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:15,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {7076#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7225#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:15,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {7076#true} call #t~ret17 := main(); {7076#true} is VALID [2022-04-28 10:09:15,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7076#true} {7076#true} #94#return; {7076#true} is VALID [2022-04-28 10:09:15,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {7076#true} assume true; {7076#true} is VALID [2022-04-28 10:09:15,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {7076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7076#true} is VALID [2022-04-28 10:09:15,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {7076#true} call ULTIMATE.init(); {7076#true} is VALID [2022-04-28 10:09:15,325 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:09:15,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327949789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:15,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:15,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:09:15,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864360828] [2022-04-28 10:09:15,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864360828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:15,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:15,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:09:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886415438] [2022-04-28 10:09:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:15,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) 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 25 [2022-04-28 10:09:15,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:15,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) 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:09:15,341 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:09:15,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:09:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:09:15,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:15,342 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 10 states, 10 states have (on average 2.1) 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:09:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,238 INFO L93 Difference]: Finished difference Result 171 states and 250 transitions. [2022-04-28 10:09:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:09:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) 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 25 [2022-04-28 10:09:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) 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:09:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-28 10:09:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) 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:09:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-28 10:09:16,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-28 10:09:16,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,366 INFO L225 Difference]: With dead ends: 171 [2022-04-28 10:09:16,366 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 10:09:16,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:16,366 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:16,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 68 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 10:09:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2022-04-28 10:09:16,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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:09:16,589 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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:09:16,592 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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:09:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,594 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2022-04-28 10:09:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 195 transitions. [2022-04-28 10:09:16,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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 145 states. [2022-04-28 10:09:16,595 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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 145 states. [2022-04-28 10:09:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,596 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2022-04-28 10:09:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 195 transitions. [2022-04-28 10:09:16,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.36) internal successors, (136), 100 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:09:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2022-04-28 10:09:16,599 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 25 [2022-04-28 10:09:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,599 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2022-04-28 10:09:16,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) 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:09:16,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 140 transitions. [2022-04-28 10:09:16,801 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:09:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2022-04-28 10:09:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:09:16,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:16,802 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:16,817 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:09:17,015 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,SelfDestructingSolverStorable15 [2022-04-28 10:09:17,015 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1353656475, now seen corresponding path program 7 times [2022-04-28 10:09:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167918710] [2022-04-28 10:09:17,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:17,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1353656475, now seen corresponding path program 8 times [2022-04-28 10:09:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:17,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378971489] [2022-04-28 10:09:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {8117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8104#true} assume true; {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8104#true} {8104#true} #94#return; {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {8104#true} call ULTIMATE.init(); {8117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:17,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {8117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {8104#true} assume true; {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8104#true} {8104#true} #94#return; {8104#true} is VALID [2022-04-28 10:09:17,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {8104#true} call #t~ret17 := main(); {8104#true} is VALID [2022-04-28 10:09:17,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {8104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8109#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {8109#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {8110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {8111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {8112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {8113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:17,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#(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; {8116#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:17,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {8116#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#false} assume !(~x~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#false} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L272 TraceCheckUtils]: 22: Hoare triple {8105#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#false} ~cond := #in~cond; {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#false} assume 0 == ~cond; {8105#false} is VALID [2022-04-28 10:09:17,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#false} assume !false; {8105#false} is VALID [2022-04-28 10:09:17,127 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:09:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378971489] [2022-04-28 10:09:17,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378971489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:17,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676827473] [2022-04-28 10:09:17,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:17,128 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:09:17,129 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:09:17,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:17,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:17,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:09:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:17,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:17,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {8104#true} call ULTIMATE.init(); {8104#true} is VALID [2022-04-28 10:09:17,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {8104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8104#true} is VALID [2022-04-28 10:09:17,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {8104#true} assume true; {8104#true} is VALID [2022-04-28 10:09:17,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8104#true} {8104#true} #94#return; {8104#true} is VALID [2022-04-28 10:09:17,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {8104#true} call #t~ret17 := main(); {8104#true} is VALID [2022-04-28 10:09:17,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {8104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8109#(= main_~y~0 0)} is VALID [2022-04-28 10:09:17,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {8109#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:17,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {8110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:17,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {8111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:17,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {8112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:17,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {8113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:17,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {8114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:17,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#(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; {8160#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {8160#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#false} assume !(~x~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#false} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L272 TraceCheckUtils]: 22: Hoare triple {8105#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#false} ~cond := #in~cond; {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#false} assume 0 == ~cond; {8105#false} is VALID [2022-04-28 10:09:17,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#false} assume !false; {8105#false} is VALID [2022-04-28 10:09:17,360 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:09:17,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:17,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {8105#false} assume !false; {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {8105#false} assume 0 == ~cond; {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {8105#false} ~cond := #in~cond; {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L272 TraceCheckUtils]: 22: Hoare triple {8105#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {8105#false} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {8105#false} assume !(~x~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#false} assume !(~y~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {8105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8105#false} is VALID [2022-04-28 10:09:17,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {8230#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8105#false} is VALID [2022-04-28 10:09:17,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#(< 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; {8230#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:17,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {8238#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {8234#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:17,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {8238#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8238#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:17,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {8245#(< 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; {8238#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:17,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {8249#(< 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; {8245#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:17,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {8253#(< 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; {8249#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:17,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {8257#(< 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; {8253#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:17,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {8261#(< 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; {8257#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:17,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {8104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8261#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:17,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {8104#true} call #t~ret17 := main(); {8104#true} is VALID [2022-04-28 10:09:17,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8104#true} {8104#true} #94#return; {8104#true} is VALID [2022-04-28 10:09:17,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {8104#true} assume true; {8104#true} is VALID [2022-04-28 10:09:17,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {8104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8104#true} is VALID [2022-04-28 10:09:17,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {8104#true} call ULTIMATE.init(); {8104#true} is VALID [2022-04-28 10:09:17,528 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:09:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676827473] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:17,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:17,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:09:17,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167918710] [2022-04-28 10:09:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167918710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:17,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:17,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:09:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201784144] [2022-04-28 10:09:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:09:17,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:17,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:09:17,543 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:09:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:09:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:09:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:09:17,544 INFO L87 Difference]: Start difference. First operand 105 states and 140 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:09:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:18,721 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-04-28 10:09:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:09:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:09:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:09:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-28 10:09:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:09:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-28 10:09:18,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2022-04-28 10:09:18,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,812 INFO L225 Difference]: With dead ends: 195 [2022-04-28 10:09:18,812 INFO L226 Difference]: Without dead ends: 169 [2022-04-28 10:09:18,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:09:18,813 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 75 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:18,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 77 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-28 10:09:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2022-04-28 10:09:19,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:19,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call 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:19,114 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call 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:19,114 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call 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:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,117 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2022-04-28 10:09:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2022-04-28 10:09:19,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-28 10:09:19,117 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-28 10:09:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:19,119 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2022-04-28 10:09:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2022-04-28 10:09:19,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:19,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:19,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:19,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call 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:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2022-04-28 10:09:19,121 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 26 [2022-04-28 10:09:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:19,121 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2022-04-28 10:09:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:09:19,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 161 transitions. [2022-04-28 10:09:19,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2022-04-28 10:09:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:19,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:19,387 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:19,403 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:09:19,600 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,SelfDestructingSolverStorable16 [2022-04-28 10:09:19,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -812701032, now seen corresponding path program 7 times [2022-04-28 10:09:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:19,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229680193] [2022-04-28 10:09:19,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:19,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -812701032, now seen corresponding path program 8 times [2022-04-28 10:09:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:19,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112299858] [2022-04-28 10:09:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {9282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9268#true} is VALID [2022-04-28 10:09:19,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {9268#true} assume true; {9268#true} is VALID [2022-04-28 10:09:19,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9268#true} {9268#true} #94#return; {9268#true} is VALID [2022-04-28 10:09:19,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {9268#true} call ULTIMATE.init(); {9282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:19,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {9282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9268#true} is VALID [2022-04-28 10:09:19,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {9268#true} assume true; {9268#true} is VALID [2022-04-28 10:09:19,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9268#true} {9268#true} #94#return; {9268#true} is VALID [2022-04-28 10:09:19,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {9268#true} call #t~ret17 := main(); {9268#true} is VALID [2022-04-28 10:09:19,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {9268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9273#(= main_~y~0 0)} is VALID [2022-04-28 10:09:19,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {9273#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:19,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {9274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:19,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {9275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:19,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {9276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:19,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {9276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:19,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {9277#(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; {9278#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:19,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {9278#(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; {9279#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:19,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {9279#(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; {9280#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:19,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {9280#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9280#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:19,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {9280#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9279#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:19,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {9279#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9278#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:19,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {9278#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:19,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:19,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:19,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {9277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9281#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:19,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {9281#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {9269#false} assume !(~y~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,745 INFO L272 TraceCheckUtils]: 23: Hoare triple {9269#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9269#false} is VALID [2022-04-28 10:09:19,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {9269#false} ~cond := #in~cond; {9269#false} is VALID [2022-04-28 10:09:19,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {9269#false} assume 0 == ~cond; {9269#false} is VALID [2022-04-28 10:09:19,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {9269#false} assume !false; {9269#false} is VALID [2022-04-28 10:09:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112299858] [2022-04-28 10:09:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112299858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128565914] [2022-04-28 10:09:19,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:19,748 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:09:19,766 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:09:19,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:19,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:19,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {9268#true} call ULTIMATE.init(); {9268#true} is VALID [2022-04-28 10:09:19,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {9268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9268#true} is VALID [2022-04-28 10:09:19,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {9268#true} assume true; {9268#true} is VALID [2022-04-28 10:09:19,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9268#true} {9268#true} #94#return; {9268#true} is VALID [2022-04-28 10:09:19,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {9268#true} call #t~ret17 := main(); {9268#true} is VALID [2022-04-28 10:09:19,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {9268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9268#true} is VALID [2022-04-28 10:09:19,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {9268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:19,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {9304#(< 0 (mod (+ main_~x~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; {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:19,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:19,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:19,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:19,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:19,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:19,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {9269#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9269#false} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {9269#false} assume !(~z~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {9269#false} assume !(~y~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,915 INFO L272 TraceCheckUtils]: 23: Hoare triple {9269#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9269#false} is VALID [2022-04-28 10:09:19,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {9269#false} ~cond := #in~cond; {9269#false} is VALID [2022-04-28 10:09:19,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {9269#false} assume 0 == ~cond; {9269#false} is VALID [2022-04-28 10:09:19,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {9269#false} assume !false; {9269#false} is VALID [2022-04-28 10:09:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:09:19,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {9269#false} assume !false; {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {9269#false} assume 0 == ~cond; {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {9269#false} ~cond := #in~cond; {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L272 TraceCheckUtils]: 23: Hoare triple {9269#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {9269#false} assume !(~y~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {9269#false} assume !(~z~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {9269#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9269#false} is VALID [2022-04-28 10:09:19,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9269#false} is VALID [2022-04-28 10:09:19,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:19,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {9328#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:20,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9328#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:20,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:20,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:20,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:20,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:20,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9312#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:20,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {9304#(< 0 (mod (+ main_~x~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; {9308#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:20,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {9268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9304#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:20,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {9268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {9268#true} call #t~ret17 := main(); {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9268#true} {9268#true} #94#return; {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {9268#true} assume true; {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {9268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {9268#true} call ULTIMATE.init(); {9268#true} is VALID [2022-04-28 10:09:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:09:20,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128565914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:20,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-28 10:09:20,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:20,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229680193] [2022-04-28 10:09:20,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229680193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:20,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:20,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907689932] [2022-04-28 10:09:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:09:20,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:20,005 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), 11 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:09:20,024 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:09:20,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:20,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:09:20,025 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:21,580 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2022-04-28 10:09:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:09:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:09:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-28 10:09:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-28 10:09:21,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 125 transitions. [2022-04-28 10:09:21,694 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:09:21,696 INFO L225 Difference]: With dead ends: 216 [2022-04-28 10:09:21,696 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 10:09:21,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:21,697 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 69 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:21,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 59 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 10:09:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2022-04-28 10:09:22,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:22,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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:09:22,154 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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:09:22,154 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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:09:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,158 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2022-04-28 10:09:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2022-04-28 10:09:22,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:22,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:22,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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 172 states. [2022-04-28 10:09:22,159 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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 172 states. [2022-04-28 10:09:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:22,160 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2022-04-28 10:09:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2022-04-28 10:09:22,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:22,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:22,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:22,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 139 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:09:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2022-04-28 10:09:22,163 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 27 [2022-04-28 10:09:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:22,163 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2022-04-28 10:09:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:22,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 190 transitions. [2022-04-28 10:09:22,446 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:09:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2022-04-28 10:09:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:09:22,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:22,447 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:22,464 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:09:22,655 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,SelfDestructingSolverStorable17 [2022-04-28 10:09:22,655 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 826659752, now seen corresponding path program 9 times [2022-04-28 10:09:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1453086492] [2022-04-28 10:09:22,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:22,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 826659752, now seen corresponding path program 10 times [2022-04-28 10:09:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:22,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739810759] [2022-04-28 10:09:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {10574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10560#true} is VALID [2022-04-28 10:09:22,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {10560#true} assume true; {10560#true} is VALID [2022-04-28 10:09:22,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10560#true} {10560#true} #94#return; {10560#true} is VALID [2022-04-28 10:09:22,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {10560#true} call ULTIMATE.init(); {10574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:22,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {10574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10560#true} is VALID [2022-04-28 10:09:22,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {10560#true} assume true; {10560#true} is VALID [2022-04-28 10:09:22,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10560#true} {10560#true} #94#return; {10560#true} is VALID [2022-04-28 10:09:22,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {10560#true} call #t~ret17 := main(); {10560#true} is VALID [2022-04-28 10:09:22,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {10560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10565#(= main_~y~0 0)} is VALID [2022-04-28 10:09:22,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {10565#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:22,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {10566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:22,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {10567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:22,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {10568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:22,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {10569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:22,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {10570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:22,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {10572#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:22,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {10572#(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; {10573#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {10573#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {10561#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {10561#false} assume !(~x~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {10561#false} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L272 TraceCheckUtils]: 23: Hoare triple {10561#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {10561#false} ~cond := #in~cond; {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {10561#false} assume 0 == ~cond; {10561#false} is VALID [2022-04-28 10:09:22,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {10561#false} assume !false; {10561#false} is VALID [2022-04-28 10:09:22,789 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:09:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739810759] [2022-04-28 10:09:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739810759] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831127598] [2022-04-28 10:09:22,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:22,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:22,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:22,790 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:09:22,791 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:09:22,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:22,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:22,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:09:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:22,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:23,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {10560#true} call ULTIMATE.init(); {10560#true} is VALID [2022-04-28 10:09:23,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {10560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10560#true} is VALID [2022-04-28 10:09:23,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {10560#true} assume true; {10560#true} is VALID [2022-04-28 10:09:23,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10560#true} {10560#true} #94#return; {10560#true} is VALID [2022-04-28 10:09:23,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {10560#true} call #t~ret17 := main(); {10560#true} is VALID [2022-04-28 10:09:23,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {10560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10565#(= main_~y~0 0)} is VALID [2022-04-28 10:09:23,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {10565#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:23,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {10566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:23,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {10567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:23,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {10568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:23,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {10569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:23,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {10570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:23,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:23,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {10571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {10572#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:23,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {10572#(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; {10620#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {10620#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {10561#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {10561#false} assume !(~x~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {10561#false} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L272 TraceCheckUtils]: 23: Hoare triple {10561#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {10561#false} ~cond := #in~cond; {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {10561#false} assume 0 == ~cond; {10561#false} is VALID [2022-04-28 10:09:23,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {10561#false} assume !false; {10561#false} is VALID [2022-04-28 10:09:23,014 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:09:23,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {10561#false} assume !false; {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {10561#false} assume 0 == ~cond; {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {10561#false} ~cond := #in~cond; {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L272 TraceCheckUtils]: 23: Hoare triple {10561#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {10561#false} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {10561#false} assume !(~x~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {10561#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {10561#false} assume !(~y~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {10561#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10561#false} is VALID [2022-04-28 10:09:23,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {10690#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10561#false} is VALID [2022-04-28 10:09:23,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {10694#(< 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; {10690#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:23,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {10698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {10694#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:23,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {10698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:23,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {10705#(< 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; {10698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:23,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {10709#(< 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; {10705#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:23,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {10713#(< 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; {10709#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:23,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {10717#(< 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; {10713#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:23,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {10721#(< 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; {10717#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:23,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {10725#(< 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; {10721#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:23,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {10560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10725#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:23,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {10560#true} call #t~ret17 := main(); {10560#true} is VALID [2022-04-28 10:09:23,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10560#true} {10560#true} #94#return; {10560#true} is VALID [2022-04-28 10:09:23,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {10560#true} assume true; {10560#true} is VALID [2022-04-28 10:09:23,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {10560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10560#true} is VALID [2022-04-28 10:09:23,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {10560#true} call ULTIMATE.init(); {10560#true} is VALID [2022-04-28 10:09:23,216 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:09:23,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831127598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:23,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:23,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:09:23,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:23,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1453086492] [2022-04-28 10:09:23,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1453086492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:23,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:23,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:09:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278299569] [2022-04-28 10:09:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:09:23,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:23,218 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), 11 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:09:23,234 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:09:23,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:09:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:09:23,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:09:23,236 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:24,822 INFO L93 Difference]: Finished difference Result 245 states and 358 transitions. [2022-04-28 10:09:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:09:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 10:09:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 10:09:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 10:09:24,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-28 10:09:24,913 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:09:24,916 INFO L225 Difference]: With dead ends: 245 [2022-04-28 10:09:24,916 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 10:09:24,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:24,916 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:24,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 93 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 10:09:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2022-04-28 10:09:25,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:25,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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:09:25,330 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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:09:25,330 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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:09:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,333 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2022-04-28 10:09:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 295 transitions. [2022-04-28 10:09:25,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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 219 states. [2022-04-28 10:09:25,334 INFO L87 Difference]: Start difference. First operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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 219 states. [2022-04-28 10:09:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:25,337 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2022-04-28 10:09:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 295 transitions. [2022-04-28 10:09:25,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:25,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:25,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:25,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 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:09:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2022-04-28 10:09:25,339 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 27 [2022-04-28 10:09:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:25,339 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2022-04-28 10:09:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:09:25,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 214 transitions. [2022-04-28 10:09:25,670 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:09:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2022-04-28 10:09:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:09:25,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:25,671 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:25,687 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:09:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:25,871 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -303013947, now seen corresponding path program 11 times [2022-04-28 10:09:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:25,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1813241985] [2022-04-28 10:09:25,874 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:25,874 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:25,874 INFO L85 PathProgramCache]: Analyzing trace with hash -303013947, now seen corresponding path program 12 times [2022-04-28 10:09:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:25,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838657679] [2022-04-28 10:09:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {12031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12016#true} is VALID [2022-04-28 10:09:26,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {12016#true} assume true; {12016#true} is VALID [2022-04-28 10:09:26,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12016#true} {12016#true} #94#return; {12016#true} is VALID [2022-04-28 10:09:26,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {12016#true} call ULTIMATE.init(); {12031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:26,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12016#true} is VALID [2022-04-28 10:09:26,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {12016#true} assume true; {12016#true} is VALID [2022-04-28 10:09:26,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12016#true} {12016#true} #94#return; {12016#true} is VALID [2022-04-28 10:09:26,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {12016#true} call #t~ret17 := main(); {12016#true} is VALID [2022-04-28 10:09:26,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {12016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12021#(= main_~y~0 0)} is VALID [2022-04-28 10:09:26,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {12021#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:26,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {12022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:26,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {12023#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:26,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {12024#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:26,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {12025#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {12026#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:26,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {12027#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:26,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {12028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {12028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:26,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {12028#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {12029#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:26,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {12029#(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; {12030#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:26,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {12030#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {12017#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {12017#false} assume !(~y~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {12017#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {12017#false} assume !(~x~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {12017#false} assume !(~z~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {12017#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {12017#false} assume !(~y~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L272 TraceCheckUtils]: 24: Hoare triple {12017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {12017#false} ~cond := #in~cond; {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#false} assume 0 == ~cond; {12017#false} is VALID [2022-04-28 10:09:26,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {12017#false} assume !false; {12017#false} is VALID [2022-04-28 10:09:26,042 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:09:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:26,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838657679] [2022-04-28 10:09:26,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838657679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:26,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834906632] [2022-04-28 10:09:26,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:26,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:26,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:26,043 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:09:26,044 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:09:26,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:26,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:26,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:09:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:26,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:26,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {12016#true} call ULTIMATE.init(); {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {12016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {12016#true} assume true; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12016#true} {12016#true} #94#return; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {12016#true} call #t~ret17 := main(); {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {12016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {12016#true} assume !(~x~0 % 4294967296 > 0); {12016#true} is VALID [2022-04-28 10:09:26,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {12016#true} ~z~0 := ~y~0; {12077#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:26,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {12077#(= 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; {12081#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:26,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {12081#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {12081#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:26,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {12081#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {12017#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {12017#false} assume !(~y~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L272 TraceCheckUtils]: 24: Hoare triple {12017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {12017#false} ~cond := #in~cond; {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#false} assume 0 == ~cond; {12017#false} is VALID [2022-04-28 10:09:26,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {12017#false} assume !false; {12017#false} is VALID [2022-04-28 10:09:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:09:26,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:26,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {12017#false} assume !false; {12017#false} is VALID [2022-04-28 10:09:26,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#false} assume 0 == ~cond; {12017#false} is VALID [2022-04-28 10:09:26,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {12017#false} ~cond := #in~cond; {12017#false} is VALID [2022-04-28 10:09:26,298 INFO L272 TraceCheckUtils]: 24: Hoare triple {12017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12017#false} is VALID [2022-04-28 10:09:26,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {12017#false} assume !(~y~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {12017#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {12017#false} is VALID [2022-04-28 10:09:26,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12017#false} is VALID [2022-04-28 10:09:26,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {12088#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {12149#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12088#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {12149#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12149#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:26,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {12156#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {12149#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:26,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {12016#true} ~z~0 := ~y~0; {12156#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:26,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {12016#true} assume !(~x~0 % 4294967296 > 0); {12016#true} is VALID [2022-04-28 10:09:26,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {12016#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {12016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {12016#true} call #t~ret17 := main(); {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12016#true} {12016#true} #94#return; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {12016#true} assume true; {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {12016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {12016#true} call ULTIMATE.init(); {12016#true} is VALID [2022-04-28 10:09:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:09:26,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834906632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:26,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:26,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2022-04-28 10:09:26,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:26,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1813241985] [2022-04-28 10:09:26,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1813241985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:26,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:26,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:09:26,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074142141] [2022-04-28 10:09:26,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:09:26,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:26,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:09:26,321 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:09:26,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:09:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:09:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:26,322 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:09:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,194 INFO L93 Difference]: Finished difference Result 271 states and 399 transitions. [2022-04-28 10:09:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:09:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:09:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:09:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-28 10:09:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:09:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-28 10:09:28,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 135 transitions. [2022-04-28 10:09:28,302 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:09:28,306 INFO L225 Difference]: With dead ends: 271 [2022-04-28 10:09:28,306 INFO L226 Difference]: Without dead ends: 245 [2022-04-28 10:09:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:09:28,307 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 105 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-04-28 10:09:28,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 178. [2022-04-28 10:09:28,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:28,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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:28,772 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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:28,772 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,776 INFO L93 Difference]: Finished difference Result 245 states and 332 transitions. [2022-04-28 10:09:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 332 transitions. [2022-04-28 10:09:28,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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 245 states. [2022-04-28 10:09:28,776 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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 245 states. [2022-04-28 10:09:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:28,780 INFO L93 Difference]: Finished difference Result 245 states and 332 transitions. [2022-04-28 10:09:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 332 transitions. [2022-04-28 10:09:28,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:28,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:28,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:28,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 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:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2022-04-28 10:09:28,782 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 28 [2022-04-28 10:09:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:28,782 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2022-04-28 10:09:28,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:09:28,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 238 transitions. [2022-04-28 10:09:29,184 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:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2022-04-28 10:09:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:29,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:29,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:29,203 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:09:29,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:29,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 3 times [2022-04-28 10:09:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2103483883] [2022-04-28 10:09:29,404 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:29,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 4 times [2022-04-28 10:09:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:29,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450378752] [2022-04-28 10:09:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {13624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13614#true} is VALID [2022-04-28 10:09:29,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {13614#true} assume true; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13614#true} {13614#true} #94#return; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {13614#true} call ULTIMATE.init(); {13624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:29,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {13624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {13614#true} assume true; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13614#true} {13614#true} #94#return; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {13614#true} call #t~ret17 := main(); {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {13614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {13614#true} assume !(~x~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {13619#(<= 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; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {13620#(<= 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; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,511 INFO L272 TraceCheckUtils]: 25: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:09:29,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {13622#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13623#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:09:29,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13615#false} is VALID [2022-04-28 10:09:29,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {13615#false} assume !false; {13615#false} is VALID [2022-04-28 10:09:29,512 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:09:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450378752] [2022-04-28 10:09:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450378752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533642573] [2022-04-28 10:09:29,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:29,513 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:09:29,527 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:09:29,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:29,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:29,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:09:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:29,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {13614#true} call ULTIMATE.init(); {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {13614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {13614#true} assume true; {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13614#true} {13614#true} #94#return; {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {13614#true} call #t~ret17 := main(); {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {13614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13614#true} is VALID [2022-04-28 10:09:29,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {13614#true} assume !(~x~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {13614#true} ~z~0 := ~y~0; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {13614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {13614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {13614#true} assume !(~z~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {13614#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {13614#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {13614#true} assume !(~y~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13614#true} is VALID [2022-04-28 10:09:29,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {13614#true} assume !(~x~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,750 INFO L272 TraceCheckUtils]: 25: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:29,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {13703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:29,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {13707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13615#false} is VALID [2022-04-28 10:09:29,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {13615#false} assume !false; {13615#false} is VALID [2022-04-28 10:09:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:29,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:29,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {13615#false} assume !false; {13615#false} is VALID [2022-04-28 10:09:29,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {13707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13615#false} is VALID [2022-04-28 10:09:29,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {13703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:29,846 INFO L272 TraceCheckUtils]: 25: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:29,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:29,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:09:29,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {13614#true} assume !(~x~0 % 4294967296 > 0); {13619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:09:29,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13614#true} is VALID [2022-04-28 10:09:29,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {13614#true} assume !(~y~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {13614#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {13614#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {13614#true} assume !(~z~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {13614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {13614#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {13614#true} ~z~0 := ~y~0; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {13614#true} assume !(~x~0 % 4294967296 > 0); {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {13614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {13614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {13614#true} call #t~ret17 := main(); {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13614#true} {13614#true} #94#return; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {13614#true} assume true; {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {13614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13614#true} is VALID [2022-04-28 10:09:29,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {13614#true} call ULTIMATE.init(); {13614#true} is VALID [2022-04-28 10:09:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:29,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533642573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:29,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:29,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:09:29,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:29,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2103483883] [2022-04-28 10:09:29,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2103483883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:29,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:29,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:09:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892612686] [2022-04-28 10:09:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:29,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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 29 [2022-04-28 10:09:29,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:29,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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:09:29,873 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:09:29,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:09:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:09:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:09:29,874 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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:09:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:30,970 INFO L93 Difference]: Finished difference Result 285 states and 387 transitions. [2022-04-28 10:09:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:09:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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 29 [2022-04-28 10:09:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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:09:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 10:09:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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:09:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-28 10:09:30,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-28 10:09:31,033 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:09:31,036 INFO L225 Difference]: With dead ends: 285 [2022-04-28 10:09:31,036 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 10:09:31,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 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:09:31,037 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:31,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 53 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:09:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 10:09:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 167. [2022-04-28 10:09:31,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:31,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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,528 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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,529 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,531 INFO L93 Difference]: Finished difference Result 212 states and 287 transitions. [2022-04-28 10:09:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2022-04-28 10:09:31,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states 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:09:31,532 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states 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:09:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,535 INFO L93 Difference]: Finished difference Result 212 states and 287 transitions. [2022-04-28 10:09:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2022-04-28 10:09:31,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:31,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.3518518518518519) internal successors, (219), 162 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call 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,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2022-04-28 10:09:31,537 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 29 [2022-04-28 10:09:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:31,537 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2022-04-28 10:09:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 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:09:31,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 223 transitions. [2022-04-28 10:09:31,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2022-04-28 10:09:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:31,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:31,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:31,962 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:09:32,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,159 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 9 times [2022-04-28 10:09:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:32,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498316243] [2022-04-28 10:09:32,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:32,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -571931592, now seen corresponding path program 10 times [2022-04-28 10:09:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365698907] [2022-04-28 10:09:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {15149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15138#true} is VALID [2022-04-28 10:09:32,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {15138#true} assume true; {15138#true} is VALID [2022-04-28 10:09:32,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15138#true} {15138#true} #94#return; {15138#true} is VALID [2022-04-28 10:09:32,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {15138#true} call ULTIMATE.init(); {15149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:32,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15138#true} is VALID [2022-04-28 10:09:32,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {15138#true} assume true; {15138#true} is VALID [2022-04-28 10:09:32,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15138#true} {15138#true} #94#return; {15138#true} is VALID [2022-04-28 10:09:32,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {15138#true} call #t~ret17 := main(); {15138#true} is VALID [2022-04-28 10:09:32,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {15138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15138#true} is VALID [2022-04-28 10:09:32,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {15138#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:32,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15144#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:09:32,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:32,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:32,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:32,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {15145#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15146#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:09:32,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {15146#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15147#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:09:32,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {15147#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {15148#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {15139#false} assume !(~z~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {15139#false} assume !(~y~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L272 TraceCheckUtils]: 25: Hoare triple {15139#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {15139#false} ~cond := #in~cond; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {15139#false} assume 0 == ~cond; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {15139#false} assume !false; {15139#false} is VALID [2022-04-28 10:09:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365698907] [2022-04-28 10:09:32,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365698907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896280135] [2022-04-28 10:09:32,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:32,267 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:09:32,268 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:09:32,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:32,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:32,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:09:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:32,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {15138#true} call ULTIMATE.init(); {15138#true} is VALID [2022-04-28 10:09:32,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {15138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15138#true} is VALID [2022-04-28 10:09:32,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {15138#true} assume true; {15138#true} is VALID [2022-04-28 10:09:32,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15138#true} {15138#true} #94#return; {15138#true} is VALID [2022-04-28 10:09:32,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {15138#true} call #t~ret17 := main(); {15138#true} is VALID [2022-04-28 10:09:32,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {15138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15138#true} is VALID [2022-04-28 10:09:32,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {15138#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:32,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:32,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:32,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:32,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {15139#false} assume !(~z~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {15139#false} assume !(~y~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L272 TraceCheckUtils]: 25: Hoare triple {15139#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {15139#false} ~cond := #in~cond; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {15139#false} assume 0 == ~cond; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {15139#false} assume !false; {15139#false} is VALID [2022-04-28 10:09:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:32,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:32,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {15139#false} assume !false; {15139#false} is VALID [2022-04-28 10:09:32,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {15139#false} assume 0 == ~cond; {15139#false} is VALID [2022-04-28 10:09:32,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {15139#false} ~cond := #in~cond; {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L272 TraceCheckUtils]: 25: Hoare triple {15139#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {15139#false} assume !(~y~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {15139#false} assume !(~z~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {15139#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15139#false} is VALID [2022-04-28 10:09:32,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15139#false} is VALID [2022-04-28 10:09:32,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15194#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:32,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:32,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15178#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:09:32,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15174#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:09:32,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {15138#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15143#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:09:32,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {15138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15138#true} is VALID [2022-04-28 10:09:32,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {15138#true} call #t~ret17 := main(); {15138#true} is VALID [2022-04-28 10:09:32,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15138#true} {15138#true} #94#return; {15138#true} is VALID [2022-04-28 10:09:32,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {15138#true} assume true; {15138#true} is VALID [2022-04-28 10:09:32,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {15138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15138#true} is VALID [2022-04-28 10:09:32,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {15138#true} call ULTIMATE.init(); {15138#true} is VALID [2022-04-28 10:09:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:09:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896280135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:32,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:32,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-28 10:09:32,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498316243] [2022-04-28 10:09:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498316243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:32,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:32,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:09:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611815116] [2022-04-28 10:09:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:32,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:32,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:32,828 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:09:32,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:09:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:32,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:09:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:09:32,829 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,246 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2022-04-28 10:09:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:09:34,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 10:09:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-28 10:09:34,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-28 10:09:34,323 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:34,326 INFO L225 Difference]: With dead ends: 282 [2022-04-28 10:09:34,326 INFO L226 Difference]: Without dead ends: 245 [2022-04-28 10:09:34,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:09:34,327 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:34,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 56 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:09:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-04-28 10:09:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 176. [2022-04-28 10:09:34,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:34,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,932 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,932 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,936 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2022-04-28 10:09:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2022-04-28 10:09:34,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:34,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:34,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 245 states. [2022-04-28 10:09:34,937 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 245 states. [2022-04-28 10:09:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:34,940 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2022-04-28 10:09:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2022-04-28 10:09:34,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:34,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:34,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:34,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 171 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2022-04-28 10:09:34,949 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 29 [2022-04-28 10:09:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:34,949 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2022-04-28 10:09:34,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:09:34,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 235 transitions. [2022-04-28 10:09:35,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2022-04-28 10:09:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:09:35,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:35,468 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:35,484 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:09:35,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:35,668 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash -963160248, now seen corresponding path program 13 times [2022-04-28 10:09:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:35,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398397361] [2022-04-28 10:09:35,671 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:35,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -963160248, now seen corresponding path program 14 times [2022-04-28 10:09:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196409498] [2022-04-28 10:09:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {16760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16744#true} is VALID [2022-04-28 10:09:35,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {16744#true} assume true; {16744#true} is VALID [2022-04-28 10:09:35,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16744#true} {16744#true} #94#return; {16744#true} is VALID [2022-04-28 10:09:35,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {16744#true} call ULTIMATE.init(); {16760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:35,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {16760#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16744#true} is VALID [2022-04-28 10:09:35,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {16744#true} assume true; {16744#true} is VALID [2022-04-28 10:09:35,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16744#true} {16744#true} #94#return; {16744#true} is VALID [2022-04-28 10:09:35,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {16744#true} call #t~ret17 := main(); {16744#true} is VALID [2022-04-28 10:09:35,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {16744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16749#(= main_~y~0 0)} is VALID [2022-04-28 10:09:35,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {16749#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16750#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:35,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {16750#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16751#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:35,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {16751#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16752#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:35,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {16752#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16753#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:35,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {16753#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16754#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:35,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {16754#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16755#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:35,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {16755#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16756#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:35,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {16756#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:35,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:35,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {16758#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:35,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {16758#(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; {16759#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {16759#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {16745#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {16745#false} assume !(~x~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {16745#false} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L272 TraceCheckUtils]: 25: Hoare triple {16745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {16745#false} ~cond := #in~cond; {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {16745#false} assume 0 == ~cond; {16745#false} is VALID [2022-04-28 10:09:35,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {16745#false} assume !false; {16745#false} is VALID [2022-04-28 10:09:35,847 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:09:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:35,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196409498] [2022-04-28 10:09:35,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196409498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:35,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030327102] [2022-04-28 10:09:35,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:35,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:35,849 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:09:35,850 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:09:35,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:35,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:35,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:09:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:35,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:36,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {16744#true} call ULTIMATE.init(); {16744#true} is VALID [2022-04-28 10:09:36,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {16744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16744#true} is VALID [2022-04-28 10:09:36,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {16744#true} assume true; {16744#true} is VALID [2022-04-28 10:09:36,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16744#true} {16744#true} #94#return; {16744#true} is VALID [2022-04-28 10:09:36,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {16744#true} call #t~ret17 := main(); {16744#true} is VALID [2022-04-28 10:09:36,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {16744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16749#(= main_~y~0 0)} is VALID [2022-04-28 10:09:36,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {16749#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16750#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:36,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {16750#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16751#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:36,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {16751#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16752#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:36,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {16752#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16753#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:36,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {16753#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16754#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:36,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {16754#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16755#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:36,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {16755#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16756#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:36,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {16756#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:36,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:36,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {16757#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {16758#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:36,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {16758#(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; {16812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:36,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {16812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16745#false} is VALID [2022-04-28 10:09:36,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {16745#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {16745#false} assume !(~x~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {16745#false} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L272 TraceCheckUtils]: 25: Hoare triple {16745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {16745#false} ~cond := #in~cond; {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {16745#false} assume 0 == ~cond; {16745#false} is VALID [2022-04-28 10:09:36,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {16745#false} assume !false; {16745#false} is VALID [2022-04-28 10:09:36,122 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:09:36,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {16745#false} assume !false; {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {16745#false} assume 0 == ~cond; {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {16745#false} ~cond := #in~cond; {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L272 TraceCheckUtils]: 25: Hoare triple {16745#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {16745#false} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {16745#false} assume !(~x~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {16745#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {16745#false} assume !(~y~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {16745#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16745#false} is VALID [2022-04-28 10:09:36,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {16882#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16745#false} is VALID [2022-04-28 10:09:36,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {16886#(< 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; {16882#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:36,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {16890#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {16886#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:36,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {16890#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16890#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:36,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {16897#(< 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; {16890#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:36,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {16901#(< 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; {16897#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:36,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {16905#(< 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; {16901#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:36,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {16909#(< 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; {16905#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:36,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {16913#(< 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; {16909#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:36,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {16917#(< 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; {16913#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:36,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {16921#(< 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; {16917#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:36,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {16925#(< 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; {16921#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:36,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {16744#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16925#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:36,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {16744#true} call #t~ret17 := main(); {16744#true} is VALID [2022-04-28 10:09:36,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16744#true} {16744#true} #94#return; {16744#true} is VALID [2022-04-28 10:09:36,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {16744#true} assume true; {16744#true} is VALID [2022-04-28 10:09:36,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {16744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16744#true} is VALID [2022-04-28 10:09:36,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {16744#true} call ULTIMATE.init(); {16744#true} is VALID [2022-04-28 10:09:36,385 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:09:36,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030327102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:36,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:36,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:09:36,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:36,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398397361] [2022-04-28 10:09:36,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398397361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:36,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:36,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282771603] [2022-04-28 10:09:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:09:36,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:36,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:09:36,402 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:09:36,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:36,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:09:36,403 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:09:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,809 INFO L93 Difference]: Finished difference Result 330 states and 500 transitions. [2022-04-28 10:09:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:09:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 10:09:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:09:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-04-28 10:09:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:09:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 144 transitions. [2022-04-28 10:09:38,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 144 transitions. [2022-04-28 10:09:38,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,927 INFO L225 Difference]: With dead ends: 330 [2022-04-28 10:09:38,927 INFO L226 Difference]: Without dead ends: 298 [2022-04-28 10:09:38,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 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:09:38,927 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:38,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 105 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:09:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-28 10:09:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 194. [2022-04-28 10:09:39,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:39,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call 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:39,552 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call 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:39,552 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call 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:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,555 INFO L93 Difference]: Finished difference Result 298 states and 402 transitions. [2022-04-28 10:09:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 402 transitions. [2022-04-28 10:09:39,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-28 10:09:39,556 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 298 states. [2022-04-28 10:09:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:39,560 INFO L93 Difference]: Finished difference Result 298 states and 402 transitions. [2022-04-28 10:09:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 402 transitions. [2022-04-28 10:09:39,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:39,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:39,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:39,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 189 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call 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:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2022-04-28 10:09:39,563 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 29 [2022-04-28 10:09:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:39,563 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2022-04-28 10:09:39,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:09:39,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 260 transitions. [2022-04-28 10:09:40,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2022-04-28 10:09:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:40,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:40,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:40,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 10:09:40,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:40,362 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1141944188, now seen corresponding path program 11 times [2022-04-28 10:09:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:40,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729379153] [2022-04-28 10:09:40,364 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:40,364 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1141944188, now seen corresponding path program 12 times [2022-04-28 10:09:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:40,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214552102] [2022-04-28 10:09:40,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {18630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18614#true} is VALID [2022-04-28 10:09:40,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {18614#true} assume true; {18614#true} is VALID [2022-04-28 10:09:40,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18614#true} {18614#true} #94#return; {18614#true} is VALID [2022-04-28 10:09:40,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {18614#true} call ULTIMATE.init(); {18630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:40,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {18630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18614#true} is VALID [2022-04-28 10:09:40,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {18614#true} assume true; {18614#true} is VALID [2022-04-28 10:09:40,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18614#true} {18614#true} #94#return; {18614#true} is VALID [2022-04-28 10:09:40,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {18614#true} call #t~ret17 := main(); {18614#true} is VALID [2022-04-28 10:09:40,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {18614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18619#(= main_~y~0 0)} is VALID [2022-04-28 10:09:40,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {18619#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:40,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {18620#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:40,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {18621#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:40,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {18622#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:40,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {18623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:40,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {18623#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:40,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {18624#(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; {18625#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:40,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {18625#(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; {18626#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:40,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {18626#(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; {18627#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:40,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {18627#(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; {18628#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:40,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {18628#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18628#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:09:40,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {18628#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18627#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:40,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {18627#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18626#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:40,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {18626#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18625#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:40,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {18625#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:40,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:40,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:40,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {18624#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:40,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {18629#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {18615#false} assume !(~y~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L272 TraceCheckUtils]: 26: Hoare triple {18615#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {18615#false} ~cond := #in~cond; {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {18615#false} assume 0 == ~cond; {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {18615#false} assume !false; {18615#false} is VALID [2022-04-28 10:09:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214552102] [2022-04-28 10:09:40,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214552102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646994332] [2022-04-28 10:09:40,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:40,551 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:09:40,556 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:09:40,595 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:40,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:40,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:40,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {18614#true} call ULTIMATE.init(); {18614#true} is VALID [2022-04-28 10:09:40,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {18614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18614#true} is VALID [2022-04-28 10:09:40,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {18614#true} assume true; {18614#true} is VALID [2022-04-28 10:09:40,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18614#true} {18614#true} #94#return; {18614#true} is VALID [2022-04-28 10:09:40,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {18614#true} call #t~ret17 := main(); {18614#true} is VALID [2022-04-28 10:09:40,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {18614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18614#true} is VALID [2022-04-28 10:09:40,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {18614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:40,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {18652#(< 0 (mod (+ main_~x~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; {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:40,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:40,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {18660#(< 0 (mod (+ main_~x~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; {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:40,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:40,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:40,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {18615#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {18615#false} assume !(~z~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {18615#false} assume !(~y~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L272 TraceCheckUtils]: 26: Hoare triple {18615#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {18615#false} ~cond := #in~cond; {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {18615#false} assume 0 == ~cond; {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {18615#false} assume !false; {18615#false} is VALID [2022-04-28 10:09:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:40,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:40,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {18615#false} assume !false; {18615#false} is VALID [2022-04-28 10:09:40,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {18615#false} assume 0 == ~cond; {18615#false} is VALID [2022-04-28 10:09:40,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {18615#false} ~cond := #in~cond; {18615#false} is VALID [2022-04-28 10:09:40,848 INFO L272 TraceCheckUtils]: 26: Hoare triple {18615#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18615#false} is VALID [2022-04-28 10:09:40,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {18615#false} assume !(~y~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {18615#false} assume !(~z~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {18615#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18615#false} is VALID [2022-04-28 10:09:40,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18615#false} is VALID [2022-04-28 10:09:40,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {18683#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18683#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:40,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:40,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:40,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:40,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {18660#(< 0 (mod (+ main_~x~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; {18664#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:40,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18660#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:40,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {18652#(< 0 (mod (+ main_~x~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; {18656#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:40,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {18614#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18652#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:40,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {18614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18614#true} is VALID [2022-04-28 10:09:40,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {18614#true} call #t~ret17 := main(); {18614#true} is VALID [2022-04-28 10:09:40,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18614#true} {18614#true} #94#return; {18614#true} is VALID [2022-04-28 10:09:40,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {18614#true} assume true; {18614#true} is VALID [2022-04-28 10:09:40,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {18614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18614#true} is VALID [2022-04-28 10:09:40,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {18614#true} call ULTIMATE.init(); {18614#true} is VALID [2022-04-28 10:09:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:09:40,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646994332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:40,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:40,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:40,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:40,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729379153] [2022-04-28 10:09:40,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729379153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:40,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:40,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960167752] [2022-04-28 10:09:40,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:09:40,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:40,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:09:40,879 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:09:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:40,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:40,880 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:09:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:43,675 INFO L93 Difference]: Finished difference Result 345 states and 498 transitions. [2022-04-28 10:09:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:09:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:09:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:09:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-28 10:09:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:09:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 154 transitions. [2022-04-28 10:09:43,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 154 transitions. [2022-04-28 10:09:43,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:43,796 INFO L225 Difference]: With dead ends: 345 [2022-04-28 10:09:43,796 INFO L226 Difference]: Without dead ends: 276 [2022-04-28 10:09:43,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=2598, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:09:43,797 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:43,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:09:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-04-28 10:09:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 231. [2022-04-28 10:09:44,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:44,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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:09:44,671 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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:09:44,671 INFO L87 Difference]: Start difference. First operand 276 states. Second operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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:09:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,674 INFO L93 Difference]: Finished difference Result 276 states and 350 transitions. [2022-04-28 10:09:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 350 transitions. [2022-04-28 10:09:44,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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 276 states. [2022-04-28 10:09:44,675 INFO L87 Difference]: Start difference. First operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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 276 states. [2022-04-28 10:09:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,678 INFO L93 Difference]: Finished difference Result 276 states and 350 transitions. [2022-04-28 10:09:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 350 transitions. [2022-04-28 10:09:44,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:44,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.3274336283185841) internal successors, (300), 226 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:09:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2022-04-28 10:09:44,683 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 30 [2022-04-28 10:09:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:44,683 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2022-04-28 10:09:44,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 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:09:44,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 304 transitions. [2022-04-28 10:09:45,368 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:09:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2022-04-28 10:09:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:09:45,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:45,368 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:45,386 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:09:45,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:45,569 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 47140901, now seen corresponding path program 15 times [2022-04-28 10:09:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:45,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590749956] [2022-04-28 10:09:45,571 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:45,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash 47140901, now seen corresponding path program 16 times [2022-04-28 10:09:45,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:45,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551066641] [2022-04-28 10:09:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:45,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {20606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20589#true} is VALID [2022-04-28 10:09:45,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-04-28 10:09:45,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20589#true} {20589#true} #94#return; {20589#true} is VALID [2022-04-28 10:09:45,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {20589#true} call ULTIMATE.init(); {20606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:45,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {20606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20589#true} is VALID [2022-04-28 10:09:45,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-04-28 10:09:45,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20589#true} {20589#true} #94#return; {20589#true} is VALID [2022-04-28 10:09:45,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {20589#true} call #t~ret17 := main(); {20589#true} is VALID [2022-04-28 10:09:45,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {20589#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20594#(= main_~y~0 0)} is VALID [2022-04-28 10:09:45,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {20594#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20595#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:45,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {20595#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20596#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:45,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {20596#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20597#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:45,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {20597#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20598#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:45,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {20598#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20599#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:45,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {20599#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20600#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:45,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {20600#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20601#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:45,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {20601#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20602#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:45,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {20602#(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; {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:45,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:45,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {20604#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:45,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {20604#(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; {20605#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:45,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {20605#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:45,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {20590#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {20590#false} assume !(~x~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {20590#false} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L272 TraceCheckUtils]: 26: Hoare triple {20590#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {20590#false} ~cond := #in~cond; {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {20590#false} assume 0 == ~cond; {20590#false} is VALID [2022-04-28 10:09:45,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-04-28 10:09:45,765 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:09:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551066641] [2022-04-28 10:09:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551066641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941241205] [2022-04-28 10:09:45,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:45,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:45,766 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:09:45,767 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:09:45,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:45,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:45,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:09:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:45,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:46,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {20589#true} call ULTIMATE.init(); {20589#true} is VALID [2022-04-28 10:09:46,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20589#true} is VALID [2022-04-28 10:09:46,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-04-28 10:09:46,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20589#true} {20589#true} #94#return; {20589#true} is VALID [2022-04-28 10:09:46,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {20589#true} call #t~ret17 := main(); {20589#true} is VALID [2022-04-28 10:09:46,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {20589#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20594#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {20594#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20595#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {20595#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20596#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {20596#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20597#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {20597#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20598#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {20598#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20599#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {20599#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20600#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {20600#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20601#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:46,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {20601#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20602#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:46,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {20602#(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; {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {20603#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {20604#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:46,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {20604#(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; {20661#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:46,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {20661#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {20590#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {20590#false} assume !(~x~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {20590#false} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L272 TraceCheckUtils]: 26: Hoare triple {20590#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {20590#false} ~cond := #in~cond; {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {20590#false} assume 0 == ~cond; {20590#false} is VALID [2022-04-28 10:09:46,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-04-28 10:09:46,022 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:09:46,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {20590#false} assume 0 == ~cond; {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {20590#false} ~cond := #in~cond; {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L272 TraceCheckUtils]: 26: Hoare triple {20590#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {20590#false} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {20590#false} assume !(~x~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {20590#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {20590#false} assume !(~y~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {20590#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20590#false} is VALID [2022-04-28 10:09:46,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {20731#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20590#false} is VALID [2022-04-28 10:09:46,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {20735#(< 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; {20731#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:46,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {20739#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {20735#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:46,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {20739#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20739#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:46,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {20746#(< 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; {20739#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:46,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {20750#(< 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; {20746#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:46,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {20754#(< 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; {20750#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:46,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {20758#(< 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; {20754#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:46,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {20762#(< 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; {20758#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:46,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {20766#(< 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; {20762#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:46,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {20770#(< 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; {20766#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:46,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {20774#(< 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; {20770#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:46,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {20778#(< 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; {20774#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:46,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {20589#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20778#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:46,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {20589#true} call #t~ret17 := main(); {20589#true} is VALID [2022-04-28 10:09:46,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20589#true} {20589#true} #94#return; {20589#true} is VALID [2022-04-28 10:09:46,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {20589#true} assume true; {20589#true} is VALID [2022-04-28 10:09:46,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {20589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20589#true} is VALID [2022-04-28 10:09:46,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {20589#true} call ULTIMATE.init(); {20589#true} is VALID [2022-04-28 10:09:46,296 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:09:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941241205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:46,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:46,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:09:46,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:46,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590749956] [2022-04-28 10:09:46,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590749956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:46,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:46,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:09:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397736531] [2022-04-28 10:09:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:09:46,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:09:46,314 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:09:46,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:09:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:09:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:09:46,314 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:09:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,447 INFO L93 Difference]: Finished difference Result 399 states and 595 transitions. [2022-04-28 10:09:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:09:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 10:09:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:09:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 157 transitions. [2022-04-28 10:09:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:09:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 157 transitions. [2022-04-28 10:09:49,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 157 transitions. [2022-04-28 10:09:49,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:49,576 INFO L225 Difference]: With dead ends: 399 [2022-04-28 10:09:49,576 INFO L226 Difference]: Without dead ends: 367 [2022-04-28 10:09:49,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:09:49,577 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:49,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 125 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:09:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-28 10:09:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 251. [2022-04-28 10:09:50,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:50,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,538 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,538 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,542 INFO L93 Difference]: Finished difference Result 367 states and 491 transitions. [2022-04-28 10:09:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 491 transitions. [2022-04-28 10:09:50,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 367 states. [2022-04-28 10:09:50,544 INFO L87 Difference]: Start difference. First operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 367 states. [2022-04-28 10:09:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:50,549 INFO L93 Difference]: Finished difference Result 367 states and 491 transitions. [2022-04-28 10:09:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 491 transitions. [2022-04-28 10:09:50,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:50,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:50,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:50,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.3333333333333333) internal successors, (328), 246 states have internal predecessors, (328), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:09:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2022-04-28 10:09:50,553 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 30 [2022-04-28 10:09:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:50,553 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2022-04-28 10:09:50,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:09:50,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 251 states and 332 transitions. [2022-04-28 10:09:51,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2022-04-28 10:09:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:09:51,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:51,301 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:51,317 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:09:51,501 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,SelfDestructingSolverStorable24 [2022-04-28 10:09:51,502 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1301705448, now seen corresponding path program 17 times [2022-04-28 10:09:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146483656] [2022-04-28 10:09:51,504 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:51,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1301705448, now seen corresponding path program 18 times [2022-04-28 10:09:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305652013] [2022-04-28 10:09:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {22877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22859#true} is VALID [2022-04-28 10:09:51,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-28 10:09:51,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-28 10:09:51,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {22859#true} call ULTIMATE.init(); {22877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:51,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {22877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22859#true} is VALID [2022-04-28 10:09:51,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-28 10:09:51,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-28 10:09:51,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {22859#true} call #t~ret17 := main(); {22859#true} is VALID [2022-04-28 10:09:51,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {22859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22864#(= main_~y~0 0)} is VALID [2022-04-28 10:09:51,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {22864#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:51,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {22865#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22866#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:51,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {22866#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22867#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:51,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {22867#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22868#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:51,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {22868#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22869#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:51,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {22869#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22870#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:51,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {22870#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22871#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:51,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {22871#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22872#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:51,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {22872#(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; {22873#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:51,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {22873#(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; {22874#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:51,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {22874#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22874#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:51,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {22874#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {22875#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {22875#(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; {22876#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {22876#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {22860#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {22860#false} assume !(~y~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {22860#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {22860#false} assume !(~x~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {22860#false} assume !(~z~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {22860#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {22860#false} assume !(~y~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,694 INFO L272 TraceCheckUtils]: 27: Hoare triple {22860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22860#false} is VALID [2022-04-28 10:09:51,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {22860#false} ~cond := #in~cond; {22860#false} is VALID [2022-04-28 10:09:51,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {22860#false} assume 0 == ~cond; {22860#false} is VALID [2022-04-28 10:09:51,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {22860#false} assume !false; {22860#false} is VALID [2022-04-28 10:09:51,695 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:09:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:51,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305652013] [2022-04-28 10:09:51,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305652013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:51,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667713064] [2022-04-28 10:09:51,695 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:51,696 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:09:51,697 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:09:51,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:09:51,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:51,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:09:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:51,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:51,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {22859#true} call ULTIMATE.init(); {22859#true} is VALID [2022-04-28 10:09:51,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {22859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22859#true} is VALID [2022-04-28 10:09:51,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-28 10:09:51,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-28 10:09:51,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {22859#true} call #t~ret17 := main(); {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {22859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {22859#true} assume !(~x~0 % 4294967296 > 0); {22859#true} is VALID [2022-04-28 10:09:51,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {22859#true} ~z~0 := ~y~0; {22932#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:09:51,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {22932#(= 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; {22936#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:51,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {22936#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {22936#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:09:51,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {22936#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {22860#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {22860#false} assume !(~y~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L272 TraceCheckUtils]: 27: Hoare triple {22860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {22860#false} ~cond := #in~cond; {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {22860#false} assume 0 == ~cond; {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {22860#false} assume !false; {22860#false} is VALID [2022-04-28 10:09:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-28 10:09:51,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:51,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {22860#false} assume !false; {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {22860#false} assume 0 == ~cond; {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {22860#false} ~cond := #in~cond; {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L272 TraceCheckUtils]: 27: Hoare triple {22860#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {22860#false} assume !(~y~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {22860#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22860#false} is VALID [2022-04-28 10:09:51,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {22943#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {23004#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:51,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {23004#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23004#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {23011#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {23004#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {22859#true} ~z~0 := ~y~0; {23011#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {22859#true} assume !(~x~0 % 4294967296 > 0); {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {22859#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {22859#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {22859#true} call #t~ret17 := main(); {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22859#true} {22859#true} #94#return; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {22859#true} assume true; {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {22859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {22859#true} call ULTIMATE.init(); {22859#true} is VALID [2022-04-28 10:09:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-28 10:09:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667713064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:51,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:51,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 21 [2022-04-28 10:09:51,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:51,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146483656] [2022-04-28 10:09:51,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146483656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828478925] [2022-04-28 10:09:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:09:51,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:51,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:51,985 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:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:09:51,986 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:55,510 INFO L93 Difference]: Finished difference Result 431 states and 646 transitions. [2022-04-28 10:09:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:55,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 10:09:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2022-04-28 10:09:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 170 transitions. [2022-04-28 10:09:55,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 170 transitions. [2022-04-28 10:09:55,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:55,645 INFO L225 Difference]: With dead ends: 431 [2022-04-28 10:09:55,645 INFO L226 Difference]: Without dead ends: 399 [2022-04-28 10:09:55,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:09:55,645 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 129 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:55,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 132 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:09:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-28 10:09:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 271. [2022-04-28 10:09:56,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:56,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call 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,692 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call 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,692 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call 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,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,698 INFO L93 Difference]: Finished difference Result 399 states and 536 transitions. [2022-04-28 10:09:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 536 transitions. [2022-04-28 10:09:56,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 399 states. [2022-04-28 10:09:56,699 INFO L87 Difference]: Start difference. First operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 399 states. [2022-04-28 10:09:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:56,704 INFO L93 Difference]: Finished difference Result 399 states and 536 transitions. [2022-04-28 10:09:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 536 transitions. [2022-04-28 10:09:56,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:56,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:56,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:56,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.3383458646616542) internal successors, (356), 266 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2022-04-28 10:09:56,709 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 31 [2022-04-28 10:09:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:56,709 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2022-04-28 10:09:56,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:56,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 271 states and 360 transitions. [2022-04-28 10:09:57,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2022-04-28 10:09:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:09:57,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:57,533 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:57,550 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:09:57,733 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,SelfDestructingSolverStorable25 [2022-04-28 10:09:57,733 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1760992374, now seen corresponding path program 13 times [2022-04-28 10:09:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:57,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879728452] [2022-04-28 10:09:57,736 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:57,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1760992374, now seen corresponding path program 14 times [2022-04-28 10:09:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246916288] [2022-04-28 10:09:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {25314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {25298#true} assume true; {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25298#true} {25298#true} #94#return; {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {25298#true} call ULTIMATE.init(); {25314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:57,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {25314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {25298#true} assume true; {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25298#true} {25298#true} #94#return; {25298#true} is VALID [2022-04-28 10:09:57,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {25298#true} call #t~ret17 := main(); {25298#true} is VALID [2022-04-28 10:09:57,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {25298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25303#(= main_~y~0 0)} is VALID [2022-04-28 10:09:57,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25304#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:57,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {25304#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25305#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:57,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {25305#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25306#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:57,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {25306#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25307#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:57,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {25307#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:57,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {25308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {25308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:57,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {25308#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {25309#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:57,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {25309#(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; {25310#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:57,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {25310#(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; {25311#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:57,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {25311#(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; {25312#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {25312#(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; {25313#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {25313#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {25299#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25299#false} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {25299#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25299#false} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {25299#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25299#false} is VALID [2022-04-28 10:09:57,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {25299#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {25299#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {25299#false} assume !(~y~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {25299#false} assume !(~x~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {25299#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {25299#false} assume !(~z~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {25299#false} assume !(~y~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {25299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {25299#false} ~cond := #in~cond; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {25299#false} assume 0 == ~cond; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {25299#false} assume !false; {25299#false} is VALID [2022-04-28 10:09:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:09:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:57,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246916288] [2022-04-28 10:09:57,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246916288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:57,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107433268] [2022-04-28 10:09:57,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:57,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:57,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:57,904 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:09:57,904 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:09:57,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:57,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:57,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:09:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:57,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:58,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {25298#true} call ULTIMATE.init(); {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {25298#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {25298#true} assume true; {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25298#true} {25298#true} #94#return; {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {25298#true} call #t~ret17 := main(); {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {25298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25298#true} is VALID [2022-04-28 10:09:58,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {25298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25298#true} is VALID [2022-04-28 10:09:58,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {25298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {25339#(< 0 (mod (+ main_~x~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; {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {25347#(< 0 (mod (+ main_~x~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; {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {25299#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {25299#false} assume !(~z~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {25299#false} assume !(~y~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {25299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {25299#false} ~cond := #in~cond; {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {25299#false} assume 0 == ~cond; {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {25299#false} assume !false; {25299#false} is VALID [2022-04-28 10:09:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:09:58,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {25299#false} assume !false; {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {25299#false} assume 0 == ~cond; {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {25299#false} ~cond := #in~cond; {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L272 TraceCheckUtils]: 28: Hoare triple {25299#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {25299#false} assume !(~y~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {25299#false} assume !(~z~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {25299#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {25299#false} is VALID [2022-04-28 10:09:58,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {25299#false} is VALID [2022-04-28 10:09:58,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {25370#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25370#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:09:58,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {25347#(< 0 (mod (+ main_~x~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; {25351#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:09:58,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25347#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:09:58,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {25339#(< 0 (mod (+ main_~x~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; {25343#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:09:58,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {25298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25339#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:09:58,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {25298#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {25298#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {25298#true} call #t~ret17 := main(); {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25298#true} {25298#true} #94#return; {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {25298#true} assume true; {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {25298#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {25298#true} call ULTIMATE.init(); {25298#true} is VALID [2022-04-28 10:09:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 10:09:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107433268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:58,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-28 10:09:58,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879728452] [2022-04-28 10:09:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879728452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:58,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:09:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509150244] [2022-04-28 10:09:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-04-28 10:09:58,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:58,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:09:58,272 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:09:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:09:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:09:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:09:58,273 INFO L87 Difference]: Start difference. First operand 271 states and 360 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:10:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:00,613 INFO L93 Difference]: Finished difference Result 380 states and 517 transitions. [2022-04-28 10:10:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:10:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 32 [2022-04-28 10:10:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:10:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-28 10:10:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:10:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 103 transitions. [2022-04-28 10:10:00,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 103 transitions. [2022-04-28 10:10:00,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:00,694 INFO L225 Difference]: With dead ends: 380 [2022-04-28 10:10:00,694 INFO L226 Difference]: Without dead ends: 303 [2022-04-28 10:10:00,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:10:00,695 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:00,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 90 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-28 10:10:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 272. [2022-04-28 10:10:01,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:01,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call 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,729 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call 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,729 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call 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,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,733 INFO L93 Difference]: Finished difference Result 303 states and 405 transitions. [2022-04-28 10:10:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 405 transitions. [2022-04-28 10:10:01,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-28 10:10:01,734 INFO L87 Difference]: Start difference. First operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 303 states. [2022-04-28 10:10:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,737 INFO L93 Difference]: Finished difference Result 303 states and 405 transitions. [2022-04-28 10:10:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 405 transitions. [2022-04-28 10:10:01,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:01,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 267 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call 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,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-04-28 10:10:01,742 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 32 [2022-04-28 10:10:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:01,742 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-04-28 10:10:01,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:10:01,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 272 states and 359 transitions. [2022-04-28 10:10:02,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-04-28 10:10:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:10:02,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:02,667 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:02,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:02,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:10:02,875 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1538500741, now seen corresponding path program 19 times [2022-04-28 10:10:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:02,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376833878] [2022-04-28 10:10:02,879 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:02,879 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1538500741, now seen corresponding path program 20 times [2022-04-28 10:10:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:02,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299676590] [2022-04-28 10:10:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {27476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27457#true} is VALID [2022-04-28 10:10:03,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {27457#true} assume true; {27457#true} is VALID [2022-04-28 10:10:03,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27457#true} {27457#true} #94#return; {27457#true} is VALID [2022-04-28 10:10:03,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {27457#true} call ULTIMATE.init(); {27476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:03,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {27476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27457#true} is VALID [2022-04-28 10:10:03,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {27457#true} assume true; {27457#true} is VALID [2022-04-28 10:10:03,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27457#true} {27457#true} #94#return; {27457#true} is VALID [2022-04-28 10:10:03,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {27457#true} call #t~ret17 := main(); {27457#true} is VALID [2022-04-28 10:10:03,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {27457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27462#(= main_~y~0 0)} is VALID [2022-04-28 10:10:03,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {27462#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27463#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {27463#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27464#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {27464#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27465#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:03,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {27465#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27466#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:03,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {27466#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27467#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:03,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {27467#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27468#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:03,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {27468#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27469#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:03,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {27469#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27470#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:03,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {27470#(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; {27471#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:03,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {27471#(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; {27472#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:03,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {27472#(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; {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {27474#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {27474#(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; {27475#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {27475#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {27458#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {27458#false} assume !(~x~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {27458#false} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {27458#false} is VALID [2022-04-28 10:10:03,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,091 INFO L272 TraceCheckUtils]: 28: Hoare triple {27458#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27458#false} is VALID [2022-04-28 10:10:03,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {27458#false} ~cond := #in~cond; {27458#false} is VALID [2022-04-28 10:10:03,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {27458#false} assume 0 == ~cond; {27458#false} is VALID [2022-04-28 10:10:03,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {27458#false} assume !false; {27458#false} is VALID [2022-04-28 10:10:03,091 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:10:03,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:03,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299676590] [2022-04-28 10:10:03,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299676590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:03,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011640118] [2022-04-28 10:10:03,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:03,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:03,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:03,092 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:10:03,093 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:10:03,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:03,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:03,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:10:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:03,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:03,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {27457#true} call ULTIMATE.init(); {27457#true} is VALID [2022-04-28 10:10:03,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {27457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27457#true} is VALID [2022-04-28 10:10:03,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {27457#true} assume true; {27457#true} is VALID [2022-04-28 10:10:03,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27457#true} {27457#true} #94#return; {27457#true} is VALID [2022-04-28 10:10:03,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {27457#true} call #t~ret17 := main(); {27457#true} is VALID [2022-04-28 10:10:03,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {27457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27462#(= main_~y~0 0)} is VALID [2022-04-28 10:10:03,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {27462#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27463#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:03,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {27463#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27464#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:03,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {27464#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27465#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:03,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {27465#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27466#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:03,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {27466#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27467#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:03,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {27467#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27468#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:03,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {27468#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27469#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:03,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {27469#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27470#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:03,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {27470#(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; {27471#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:03,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {27471#(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; {27472#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:03,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {27472#(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; {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:03,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {27473#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {27474#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {27474#(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; {27537#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {27537#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {27458#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {27458#false} assume !(~x~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {27458#false} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L272 TraceCheckUtils]: 28: Hoare triple {27458#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27458#false} is VALID [2022-04-28 10:10:03,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {27458#false} ~cond := #in~cond; {27458#false} is VALID [2022-04-28 10:10:03,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {27458#false} assume 0 == ~cond; {27458#false} is VALID [2022-04-28 10:10:03,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {27458#false} assume !false; {27458#false} is VALID [2022-04-28 10:10:03,361 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:10:03,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:03,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {27458#false} assume !false; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {27458#false} assume 0 == ~cond; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {27458#false} ~cond := #in~cond; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L272 TraceCheckUtils]: 28: Hoare triple {27458#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {27458#false} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {27458#false} assume !(~x~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {27458#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {27458#false} assume !(~y~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {27458#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27458#false} is VALID [2022-04-28 10:10:03,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {27607#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27458#false} is VALID [2022-04-28 10:10:03,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {27611#(< 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; {27607#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:03,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {27615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {27611#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:03,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {27615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:03,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {27622#(< 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; {27615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:03,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {27626#(< 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; {27622#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:03,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {27630#(< 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; {27626#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:03,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {27634#(< 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; {27630#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:03,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {27638#(< 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; {27634#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:03,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {27642#(< 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; {27638#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:03,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {27646#(< 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; {27642#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:03,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {27650#(< 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; {27646#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:03,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {27654#(< 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; {27650#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:03,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {27658#(< 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; {27654#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:03,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {27662#(< 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; {27658#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:03,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {27457#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27662#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:03,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {27457#true} call #t~ret17 := main(); {27457#true} is VALID [2022-04-28 10:10:03,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27457#true} {27457#true} #94#return; {27457#true} is VALID [2022-04-28 10:10:03,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {27457#true} assume true; {27457#true} is VALID [2022-04-28 10:10:03,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {27457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27457#true} is VALID [2022-04-28 10:10:03,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {27457#true} call ULTIMATE.init(); {27457#true} is VALID [2022-04-28 10:10:03,739 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:10:03,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011640118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:03,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:03,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:10:03,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:03,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376833878] [2022-04-28 10:10:03,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376833878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:03,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:03,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:10:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004540708] [2022-04-28 10:10:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:10:03,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:03,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:03,759 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:03,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:10:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:03,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:10:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:10:03,760 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:07,631 INFO L93 Difference]: Finished difference Result 464 states and 696 transitions. [2022-04-28 10:10:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:10:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:10:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 183 transitions. [2022-04-28 10:10:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 183 transitions. [2022-04-28 10:10:07,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 183 transitions. [2022-04-28 10:10:07,765 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:07,774 INFO L225 Difference]: With dead ends: 464 [2022-04-28 10:10:07,774 INFO L226 Difference]: Without dead ends: 432 [2022-04-28 10:10:07,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 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:10:07,775 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:07,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 138 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:10:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-04-28 10:10:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 292. [2022-04-28 10:10:08,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:08,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call 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:08,884 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call 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:08,884 INFO L87 Difference]: Start difference. First operand 432 states. Second operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call 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:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:08,890 INFO L93 Difference]: Finished difference Result 432 states and 580 transitions. [2022-04-28 10:10:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 580 transitions. [2022-04-28 10:10:08,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:08,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:08,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 432 states. [2022-04-28 10:10:08,891 INFO L87 Difference]: Start difference. First operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 432 states. [2022-04-28 10:10:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:08,898 INFO L93 Difference]: Finished difference Result 432 states and 580 transitions. [2022-04-28 10:10:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 580 transitions. [2022-04-28 10:10:08,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:08,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:08,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:08,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 287 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call 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:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 387 transitions. [2022-04-28 10:10:08,903 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 387 transitions. Word has length 32 [2022-04-28 10:10:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:08,903 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 387 transitions. [2022-04-28 10:10:08,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:08,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 387 transitions. [2022-04-28 10:10:09,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 387 transitions. [2022-04-28 10:10:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:10:09,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:09,775 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:09,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:09,976 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 15 times [2022-04-28 10:10:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690304114] [2022-04-28 10:10:09,978 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:09,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2109757017, now seen corresponding path program 16 times [2022-04-28 10:10:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:09,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083748172] [2022-04-28 10:10:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:10,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {30102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30089#true} is VALID [2022-04-28 10:10:10,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {30089#true} assume true; {30089#true} is VALID [2022-04-28 10:10:10,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30089#true} {30089#true} #94#return; {30089#true} is VALID [2022-04-28 10:10:10,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {30089#true} call ULTIMATE.init(); {30102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:10,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {30102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30089#true} is VALID [2022-04-28 10:10:10,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {30089#true} assume true; {30089#true} is VALID [2022-04-28 10:10:10,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30089#true} {30089#true} #94#return; {30089#true} is VALID [2022-04-28 10:10:10,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {30089#true} call #t~ret17 := main(); {30089#true} is VALID [2022-04-28 10:10:10,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {30089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30089#true} is VALID [2022-04-28 10:10:10,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {30089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30095#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:10:10,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {30095#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30096#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {30096#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:10,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:10,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:10:10,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {30097#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30098#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:10:10,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {30098#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30099#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:10,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {30099#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30100#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:10:10,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {30100#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:10:10,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {30101#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {30090#false} assume !(~z~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {30090#false} assume !(~y~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L272 TraceCheckUtils]: 29: Hoare triple {30090#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {30090#false} ~cond := #in~cond; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {30090#false} assume 0 == ~cond; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {30090#false} assume !false; {30090#false} is VALID [2022-04-28 10:10:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083748172] [2022-04-28 10:10:10,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083748172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646020240] [2022-04-28 10:10:10,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:10,106 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:10:10,107 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:10:10,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:10,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:10,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:10:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:10,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:10,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {30089#true} call ULTIMATE.init(); {30089#true} is VALID [2022-04-28 10:10:10,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {30089#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30089#true} is VALID [2022-04-28 10:10:10,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {30089#true} assume true; {30089#true} is VALID [2022-04-28 10:10:10,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30089#true} {30089#true} #94#return; {30089#true} is VALID [2022-04-28 10:10:10,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {30089#true} call #t~ret17 := main(); {30089#true} is VALID [2022-04-28 10:10:10,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {30089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30089#true} is VALID [2022-04-28 10:10:10,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {30089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:10,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:10,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {30090#false} assume !(~z~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {30090#false} assume !(~y~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,480 INFO L272 TraceCheckUtils]: 29: Hoare triple {30090#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30090#false} is VALID [2022-04-28 10:10:10,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {30090#false} ~cond := #in~cond; {30090#false} is VALID [2022-04-28 10:10:10,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {30090#false} assume 0 == ~cond; {30090#false} is VALID [2022-04-28 10:10:10,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {30090#false} assume !false; {30090#false} is VALID [2022-04-28 10:10:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:10,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:10,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {30090#false} assume !false; {30090#false} is VALID [2022-04-28 10:10:10,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {30090#false} assume 0 == ~cond; {30090#false} is VALID [2022-04-28 10:10:10,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {30090#false} ~cond := #in~cond; {30090#false} is VALID [2022-04-28 10:10:10,739 INFO L272 TraceCheckUtils]: 29: Hoare triple {30090#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30090#false} is VALID [2022-04-28 10:10:10,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {30090#false} assume !(~y~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {30090#false} assume !(~z~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {30090#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30090#false} is VALID [2022-04-28 10:10:10,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30090#false} is VALID [2022-04-28 10:10:10,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30154#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:10,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30135#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:10:10,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30131#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:10,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30127#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:10:10,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {30089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30094#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:10:10,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {30089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30089#true} is VALID [2022-04-28 10:10:10,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {30089#true} call #t~ret17 := main(); {30089#true} is VALID [2022-04-28 10:10:10,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30089#true} {30089#true} #94#return; {30089#true} is VALID [2022-04-28 10:10:10,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {30089#true} assume true; {30089#true} is VALID [2022-04-28 10:10:10,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {30089#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30089#true} is VALID [2022-04-28 10:10:10,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {30089#true} call ULTIMATE.init(); {30089#true} is VALID [2022-04-28 10:10:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:10:10,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646020240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:10,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:10,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-28 10:10:10,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:10,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690304114] [2022-04-28 10:10:10,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690304114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:10,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:10,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:10:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393696573] [2022-04-28 10:10:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) 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 33 [2022-04-28 10:10:10,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:10,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) 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:10:10,772 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:10:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:10:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:10:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:10:10,773 INFO L87 Difference]: Start difference. First operand 292 states and 387 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) 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:10:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:13,894 INFO L93 Difference]: Finished difference Result 518 states and 707 transitions. [2022-04-28 10:10:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:10:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) 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 33 [2022-04-28 10:10:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) 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:10:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-04-28 10:10:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) 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:10:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-04-28 10:10:13,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 94 transitions. [2022-04-28 10:10:13,981 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:10:13,990 INFO L225 Difference]: With dead ends: 518 [2022-04-28 10:10:13,990 INFO L226 Difference]: Without dead ends: 471 [2022-04-28 10:10:13,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:10:13,991 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:13,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 60 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-28 10:10:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 302. [2022-04-28 10:10:15,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:15,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call 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,290 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call 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,291 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call 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,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:15,298 INFO L93 Difference]: Finished difference Result 471 states and 635 transitions. [2022-04-28 10:10:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 635 transitions. [2022-04-28 10:10:15,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:15,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:15,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-28 10:10:15,299 INFO L87 Difference]: Start difference. First operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 471 states. [2022-04-28 10:10:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:15,310 INFO L93 Difference]: Finished difference Result 471 states and 635 transitions. [2022-04-28 10:10:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 635 transitions. [2022-04-28 10:10:15,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:15,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:15,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:15,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 297 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call 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,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 401 transitions. [2022-04-28 10:10:15,314 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 401 transitions. Word has length 33 [2022-04-28 10:10:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:15,315 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 401 transitions. [2022-04-28 10:10:15,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) 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:10:15,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 302 states and 401 transitions. [2022-04-28 10:10:17,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 401 transitions. [2022-04-28 10:10:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:10:17,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:17,017 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:17,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:17,217 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,SelfDestructingSolverStorable28 [2022-04-28 10:10:17,217 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2118455400, now seen corresponding path program 17 times [2022-04-28 10:10:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:17,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477782116] [2022-04-28 10:10:17,221 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:17,221 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2118455400, now seen corresponding path program 18 times [2022-04-28 10:10:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122843960] [2022-04-28 10:10:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:17,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {32920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32902#true} is VALID [2022-04-28 10:10:17,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:10:17,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32902#true} {32902#true} #94#return; {32902#true} is VALID [2022-04-28 10:10:17,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:17,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {32920#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32902#true} is VALID [2022-04-28 10:10:17,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:10:17,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #94#return; {32902#true} is VALID [2022-04-28 10:10:17,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret17 := main(); {32902#true} is VALID [2022-04-28 10:10:17,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32907#(= main_~y~0 0)} is VALID [2022-04-28 10:10:17,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {32907#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:17,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {32908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:17,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {32909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:17,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {32910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:17,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {32911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:17,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:17,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {32913#(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; {32914#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:17,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {32914#(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; {32915#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:17,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {32915#(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; {32916#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:17,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {32916#(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; {32917#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:17,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {32917#(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; {32918#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:17,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {32918#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32918#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:10:17,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {32918#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32917#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:17,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {32917#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32916#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:17,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {32916#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32915#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:17,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {32915#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32914#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:17,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {32914#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:17,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:17,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:17,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {32913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {32919#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:17,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {32919#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {32903#false} assume !(~y~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L272 TraceCheckUtils]: 29: Hoare triple {32903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:10:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122843960] [2022-04-28 10:10:17,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122843960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239882059] [2022-04-28 10:10:17,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:17,476 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:10:17,477 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:10:17,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:10:17,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:17,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:10:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:17,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:17,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-28 10:10:17,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32902#true} is VALID [2022-04-28 10:10:17,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:10:17,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #94#return; {32902#true} is VALID [2022-04-28 10:10:17,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret17 := main(); {32902#true} is VALID [2022-04-28 10:10:17,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32902#true} is VALID [2022-04-28 10:10:17,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {32902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:17,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {32942#(< 0 (mod (+ main_~x~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; {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:17,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:17,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {32950#(< 0 (mod (+ main_~x~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; {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:17,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {32954#(< 0 (mod (+ main_~x~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; {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {32958#(< 0 (mod (+ 5 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; {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:17,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:17,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:17,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:17,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {32903#false} assume !(~y~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L272 TraceCheckUtils]: 29: Hoare triple {32903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:10:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:10:17,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L272 TraceCheckUtils]: 29: Hoare triple {32903#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {32903#false} assume !(~y~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {32903#false} is VALID [2022-04-28 10:10:17,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-28 10:10:17,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {32980#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32980#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:10:17,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:17,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:17,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:17,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {32958#(< 0 (mod (+ 5 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; {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:17,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {32954#(< 0 (mod (+ main_~x~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; {32958#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:10:17,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {32950#(< 0 (mod (+ main_~x~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; {32954#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:10:17,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32950#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:10:17,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {32942#(< 0 (mod (+ main_~x~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; {32946#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:10:17,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {32902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32942#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:10:17,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret17 := main(); {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #94#return; {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-28 10:10:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:10:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239882059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:17,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:10:17,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477782116] [2022-04-28 10:10:17,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477782116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:17,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:10:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562018871] [2022-04-28 10:10:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:10:17,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:17,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:17,871 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:17,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:10:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:10:17,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:10:17,872 INFO L87 Difference]: Start difference. First operand 302 states and 401 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:22,840 INFO L93 Difference]: Finished difference Result 483 states and 706 transitions. [2022-04-28 10:10:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 10:10:22,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:10:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 206 transitions. [2022-04-28 10:10:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 206 transitions. [2022-04-28 10:10:22,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 206 transitions. [2022-04-28 10:10:23,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:23,009 INFO L225 Difference]: With dead ends: 483 [2022-04-28 10:10:23,009 INFO L226 Difference]: Without dead ends: 420 [2022-04-28 10:10:23,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=4473, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:10:23,011 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:23,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 93 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:10:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-28 10:10:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350. [2022-04-28 10:10:24,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:24,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call 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,666 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call 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,666 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call 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,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,672 INFO L93 Difference]: Finished difference Result 420 states and 532 transitions. [2022-04-28 10:10:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 532 transitions. [2022-04-28 10:10:24,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 10:10:24,673 INFO L87 Difference]: Start difference. First operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 420 states. [2022-04-28 10:10:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:24,679 INFO L93 Difference]: Finished difference Result 420 states and 532 transitions. [2022-04-28 10:10:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 532 transitions. [2022-04-28 10:10:24,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:24,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:24,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:24,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 345 states have (on average 1.3246376811594203) internal successors, (457), 345 states have internal predecessors, (457), 3 states have call successors, (3), 3 states have call 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,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2022-04-28 10:10:24,685 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 33 [2022-04-28 10:10:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:24,685 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2022-04-28 10:10:24,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 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:24,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 350 states and 461 transitions. [2022-04-28 10:10:26,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2022-04-28 10:10:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:10:26,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:26,184 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:26,200 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:10:26,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:26,384 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash 289220232, now seen corresponding path program 21 times [2022-04-28 10:10:26,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:26,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296321412] [2022-04-28 10:10:26,387 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:26,387 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash 289220232, now seen corresponding path program 22 times [2022-04-28 10:10:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:26,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231802114] [2022-04-28 10:10:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {35746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35726#true} is VALID [2022-04-28 10:10:26,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {35726#true} assume true; {35726#true} is VALID [2022-04-28 10:10:26,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35726#true} {35726#true} #94#return; {35726#true} is VALID [2022-04-28 10:10:26,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {35726#true} call ULTIMATE.init(); {35746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:26,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {35746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35726#true} is VALID [2022-04-28 10:10:26,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {35726#true} assume true; {35726#true} is VALID [2022-04-28 10:10:26,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35726#true} {35726#true} #94#return; {35726#true} is VALID [2022-04-28 10:10:26,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {35726#true} call #t~ret17 := main(); {35726#true} is VALID [2022-04-28 10:10:26,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {35726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35731#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {35731#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {35732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {35733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {35734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {35735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {35736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {35737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:26,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {35738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:26,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {35739#(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; {35740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:26,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {35740#(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; {35741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:26,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {35741#(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; {35742#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:26,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {35742#(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; {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {35744#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {35744#(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; {35745#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {35745#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {35727#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {35727#false} assume !(~x~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {35727#false} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L272 TraceCheckUtils]: 29: Hoare triple {35727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {35727#false} ~cond := #in~cond; {35727#false} is VALID [2022-04-28 10:10:26,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {35727#false} assume 0 == ~cond; {35727#false} is VALID [2022-04-28 10:10:26,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {35727#false} assume !false; {35727#false} is VALID [2022-04-28 10:10:26,627 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:10:26,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231802114] [2022-04-28 10:10:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231802114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225368045] [2022-04-28 10:10:26,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:26,628 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:10:26,628 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:10:26,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:26,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:26,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:10:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:26,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {35726#true} call ULTIMATE.init(); {35726#true} is VALID [2022-04-28 10:10:26,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {35726#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35726#true} is VALID [2022-04-28 10:10:26,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {35726#true} assume true; {35726#true} is VALID [2022-04-28 10:10:26,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35726#true} {35726#true} #94#return; {35726#true} is VALID [2022-04-28 10:10:26,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {35726#true} call #t~ret17 := main(); {35726#true} is VALID [2022-04-28 10:10:26,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {35726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35731#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {35731#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {35732#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {35733#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {35734#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {35735#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {35736#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {35737#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:26,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {35738#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35739#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:26,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {35739#(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; {35740#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:26,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {35740#(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; {35741#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:26,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {35741#(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; {35742#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:26,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {35742#(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; {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {35743#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {35744#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:26,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {35744#(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; {35810#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {35810#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {35727#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {35727#false} assume !(~x~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {35727#false} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L272 TraceCheckUtils]: 29: Hoare triple {35727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {35727#false} ~cond := #in~cond; {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {35727#false} assume 0 == ~cond; {35727#false} is VALID [2022-04-28 10:10:26,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {35727#false} assume !false; {35727#false} is VALID [2022-04-28 10:10:26,928 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:10:26,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {35727#false} assume !false; {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {35727#false} assume 0 == ~cond; {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {35727#false} ~cond := #in~cond; {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L272 TraceCheckUtils]: 29: Hoare triple {35727#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {35727#false} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {35727#false} assume !(~x~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {35727#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {35727#false} assume !(~y~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:27,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {35727#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35727#false} is VALID [2022-04-28 10:10:27,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {35880#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35727#false} is VALID [2022-04-28 10:10:27,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {35884#(< 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; {35880#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:27,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {35888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {35884#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:27,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {35888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:27,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {35895#(< 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; {35888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:27,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {35899#(< 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; {35895#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:27,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {35903#(< 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; {35899#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:27,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {35907#(< 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; {35903#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:27,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {35911#(< 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; {35907#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:27,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {35915#(< 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; {35911#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:27,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {35919#(< 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; {35915#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {35923#(< 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; {35919#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:27,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {35927#(< 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; {35923#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {35931#(< 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; {35927#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:27,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {35935#(< 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; {35931#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:27,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {35939#(< 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; {35935#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:27,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {35726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35939#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:27,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {35726#true} call #t~ret17 := main(); {35726#true} is VALID [2022-04-28 10:10:27,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35726#true} {35726#true} #94#return; {35726#true} is VALID [2022-04-28 10:10:27,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {35726#true} assume true; {35726#true} is VALID [2022-04-28 10:10:27,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {35726#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35726#true} is VALID [2022-04-28 10:10:27,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {35726#true} call ULTIMATE.init(); {35726#true} is VALID [2022-04-28 10:10:27,332 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:10:27,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225368045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:27,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:10:27,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:27,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296321412] [2022-04-28 10:10:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296321412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:27,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:27,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:10:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226258251] [2022-04-28 10:10:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:10:27,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:27,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:27,352 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:27,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:10:27,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:10:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:10:27,352 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,573 INFO L93 Difference]: Finished difference Result 576 states and 858 transitions. [2022-04-28 10:10:32,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:10:32,573 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 10:10:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 196 transitions. [2022-04-28 10:10:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 196 transitions. [2022-04-28 10:10:32,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 196 transitions. [2022-04-28 10:10:32,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:32,733 INFO L225 Difference]: With dead ends: 576 [2022-04-28 10:10:32,733 INFO L226 Difference]: Without dead ends: 542 [2022-04-28 10:10:32,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:10:32,734 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 156 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:32,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 156 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 10:10:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-28 10:10:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 374. [2022-04-28 10:10:34,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:34,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call 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:34,518 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call 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:34,518 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call 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:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,527 INFO L93 Difference]: Finished difference Result 542 states and 721 transitions. [2022-04-28 10:10:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 721 transitions. [2022-04-28 10:10:34,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 10:10:34,528 INFO L87 Difference]: Start difference. First operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 10:10:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:34,537 INFO L93 Difference]: Finished difference Result 542 states and 721 transitions. [2022-04-28 10:10:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 721 transitions. [2022-04-28 10:10:34,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:34,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:34,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:34,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 369 states have (on average 1.3306233062330624) internal successors, (491), 369 states have internal predecessors, (491), 3 states have call successors, (3), 3 states have call 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:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 495 transitions. [2022-04-28 10:10:34,544 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 495 transitions. Word has length 33 [2022-04-28 10:10:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:34,545 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 495 transitions. [2022-04-28 10:10:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 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:34,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 495 transitions. [2022-04-28 10:10:36,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 495 transitions. [2022-04-28 10:10:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:10:36,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:36,114 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:36,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:36,327 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,SelfDestructingSolverStorable30 [2022-04-28 10:10:36,327 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 216230117, now seen corresponding path program 23 times [2022-04-28 10:10:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:36,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020369228] [2022-04-28 10:10:36,330 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:36,330 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:36,330 INFO L85 PathProgramCache]: Analyzing trace with hash 216230117, now seen corresponding path program 24 times [2022-04-28 10:10:36,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:36,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088171890] [2022-04-28 10:10:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:36,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {38997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38976#true} is VALID [2022-04-28 10:10:36,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {38976#true} assume true; {38976#true} is VALID [2022-04-28 10:10:36,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38976#true} {38976#true} #94#return; {38976#true} is VALID [2022-04-28 10:10:36,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {38976#true} call ULTIMATE.init(); {38997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:36,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {38997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38976#true} is VALID [2022-04-28 10:10:36,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {38976#true} assume true; {38976#true} is VALID [2022-04-28 10:10:36,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38976#true} {38976#true} #94#return; {38976#true} is VALID [2022-04-28 10:10:36,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {38976#true} call #t~ret17 := main(); {38976#true} is VALID [2022-04-28 10:10:36,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {38976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38981#(= main_~y~0 0)} is VALID [2022-04-28 10:10:36,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {38981#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:36,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {38982#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:36,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {38983#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:36,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {38984#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:36,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {38985#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:36,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {38986#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:36,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {38987#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38988#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:36,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {38988#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38989#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:36,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {38989#(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; {38990#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:36,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {38990#(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; {38991#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:36,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {38991#(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; {38992#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:36,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {38992#(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; {38993#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:36,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {38993#(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; {38994#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:36,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {38994#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {38994#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:36,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {38994#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {38995#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {38995#(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; {38996#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {38996#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {38977#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {38977#false} assume !(~y~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {38977#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {38977#false} assume !(~x~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {38977#false} assume !(~z~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {38977#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38977#false} is VALID [2022-04-28 10:10:36,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {38977#false} assume !(~y~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,577 INFO L272 TraceCheckUtils]: 30: Hoare triple {38977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38977#false} is VALID [2022-04-28 10:10:36,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {38977#false} ~cond := #in~cond; {38977#false} is VALID [2022-04-28 10:10:36,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {38977#false} assume 0 == ~cond; {38977#false} is VALID [2022-04-28 10:10:36,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {38977#false} assume !false; {38977#false} is VALID [2022-04-28 10:10:36,577 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:10:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:36,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088171890] [2022-04-28 10:10:36,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088171890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:36,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754207939] [2022-04-28 10:10:36,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:36,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:36,578 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:10:36,579 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:10:36,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:36,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:36,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:10:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:36,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:36,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {38976#true} call ULTIMATE.init(); {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {38976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {38976#true} assume true; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38976#true} {38976#true} #94#return; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {38976#true} call #t~ret17 := main(); {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {38976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {38976#true} assume !(~x~0 % 4294967296 > 0); {38976#true} is VALID [2022-04-28 10:10:36,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {38976#true} ~z~0 := ~y~0; {38976#true} is VALID [2022-04-28 10:10:36,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {38976#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {38977#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {38977#false} assume !(~y~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L272 TraceCheckUtils]: 30: Hoare triple {38977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {38977#false} ~cond := #in~cond; {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {38977#false} assume 0 == ~cond; {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {38977#false} assume !false; {38977#false} is VALID [2022-04-28 10:10:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-28 10:10:36,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:36,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {38977#false} assume !false; {38977#false} is VALID [2022-04-28 10:10:36,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {38977#false} assume 0 == ~cond; {38977#false} is VALID [2022-04-28 10:10:36,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {38977#false} ~cond := #in~cond; {38977#false} is VALID [2022-04-28 10:10:36,795 INFO L272 TraceCheckUtils]: 30: Hoare triple {38977#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {38977#false} is VALID [2022-04-28 10:10:36,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {38977#false} assume !(~y~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {38977#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {38977#false} is VALID [2022-04-28 10:10:36,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38977#false} is VALID [2022-04-28 10:10:36,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {39071#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39071#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:36,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {38976#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39064#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:10:36,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {38976#true} ~z~0 := ~y~0; {38976#true} is VALID [2022-04-28 10:10:36,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {38976#true} assume !(~x~0 % 4294967296 > 0); {38976#true} is VALID [2022-04-28 10:10:36,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {38976#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {38976#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {38976#true} call #t~ret17 := main(); {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38976#true} {38976#true} #94#return; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {38976#true} assume true; {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {38976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38976#true} is VALID [2022-04-28 10:10:36,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {38976#true} call ULTIMATE.init(); {38976#true} is VALID [2022-04-28 10:10:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-28 10:10:36,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754207939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:36,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:36,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 4] total 21 [2022-04-28 10:10:36,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:36,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020369228] [2022-04-28 10:10:36,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020369228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:36,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:36,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:10:36,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000208617] [2022-04-28 10:10:36,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 10:10:36,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:36,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:36,895 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:36,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:10:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:10:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:10:36,895 INFO L87 Difference]: Start difference. First operand 374 states and 495 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:42,711 INFO L93 Difference]: Finished difference Result 613 states and 917 transitions. [2022-04-28 10:10:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 10:10:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 209 transitions. [2022-04-28 10:10:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 209 transitions. [2022-04-28 10:10:42,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 209 transitions. [2022-04-28 10:10:42,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:42,881 INFO L225 Difference]: With dead ends: 613 [2022-04-28 10:10:42,881 INFO L226 Difference]: Without dead ends: 579 [2022-04-28 10:10:42,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:10:42,882 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 171 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:42,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 165 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:10:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-04-28 10:10:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 398. [2022-04-28 10:10:44,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:44,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 579 states. Second operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call 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:44,754 INFO L74 IsIncluded]: Start isIncluded. First operand 579 states. Second operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call 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:44,754 INFO L87 Difference]: Start difference. First operand 579 states. Second operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call 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:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:44,764 INFO L93 Difference]: Finished difference Result 579 states and 773 transitions. [2022-04-28 10:10:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 773 transitions. [2022-04-28 10:10:44,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:44,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:44,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-28 10:10:44,765 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-28 10:10:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:44,775 INFO L93 Difference]: Finished difference Result 579 states and 773 transitions. [2022-04-28 10:10:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 773 transitions. [2022-04-28 10:10:44,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:44,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:44,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:44,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.3358778625954197) internal successors, (525), 393 states have internal predecessors, (525), 3 states have call successors, (3), 3 states have call 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:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 529 transitions. [2022-04-28 10:10:44,783 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 529 transitions. Word has length 34 [2022-04-28 10:10:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:44,783 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 529 transitions. [2022-04-28 10:10:44,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:44,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 529 transitions. [2022-04-28 10:10:46,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 529 transitions. [2022-04-28 10:10:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:46,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:46,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:46,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:46,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:46,681 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 5 times [2022-04-28 10:10:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:46,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254163977] [2022-04-28 10:10:46,683 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:46,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 6 times [2022-04-28 10:10:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504209] [2022-04-28 10:10:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:46,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {42428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42417#true} is VALID [2022-04-28 10:10:46,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {42417#true} assume true; {42417#true} is VALID [2022-04-28 10:10:46,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42417#true} {42417#true} #94#return; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {42417#true} call ULTIMATE.init(); {42428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {42428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {42417#true} assume true; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42417#true} {42417#true} #94#return; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {42417#true} call #t~ret17 := main(); {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {42417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:46,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:46,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {42417#true} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {42422#(<= 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; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:46,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {42423#(<= 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; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {42424#(<= 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; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:46,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:46,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:46,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:46,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:46,884 INFO L272 TraceCheckUtils]: 31: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42426#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:46,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {42426#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {42427#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:46,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {42427#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42418#false} is VALID [2022-04-28 10:10:46,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {42418#false} assume !false; {42418#false} is VALID [2022-04-28 10:10:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:10:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:46,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504209] [2022-04-28 10:10:46,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:46,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508773622] [2022-04-28 10:10:46,885 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:46,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:46,886 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:10:46,893 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:10:46,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:10:46,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:46,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:10:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:46,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:47,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {42417#true} call ULTIMATE.init(); {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {42417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {42417#true} assume true; {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42417#true} {42417#true} #94#return; {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {42417#true} call #t~ret17 := main(); {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {42417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {42417#true} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {42422#(<= 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; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {42423#(<= 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; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {42424#(<= 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; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,199 INFO L272 TraceCheckUtils]: 31: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:47,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {42525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:47,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {42529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42418#false} is VALID [2022-04-28 10:10:47,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {42418#false} assume !false; {42418#false} is VALID [2022-04-28 10:10:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:10:47,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:47,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {42418#false} assume !false; {42418#false} is VALID [2022-04-28 10:10:47,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {42529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42418#false} is VALID [2022-04-28 10:10:47,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {42525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:10:47,357 INFO L272 TraceCheckUtils]: 31: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:10:47,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {42424#(<= 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; {42425#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {42423#(<= 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; {42424#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:10:47,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {42422#(<= 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; {42423#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {42417#true} assume !(~x~0 % 4294967296 > 0); {42422#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {42417#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42417#true} is VALID [2022-04-28 10:10:47,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {42417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42417#true} is VALID [2022-04-28 10:10:47,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {42417#true} call #t~ret17 := main(); {42417#true} is VALID [2022-04-28 10:10:47,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42417#true} {42417#true} #94#return; {42417#true} is VALID [2022-04-28 10:10:47,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {42417#true} assume true; {42417#true} is VALID [2022-04-28 10:10:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {42417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42417#true} is VALID [2022-04-28 10:10:47,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {42417#true} call ULTIMATE.init(); {42417#true} is VALID [2022-04-28 10:10:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:10:47,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508773622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:47,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:47,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-28 10:10:47,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:47,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254163977] [2022-04-28 10:10:47,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254163977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:47,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:47,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:10:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917008730] [2022-04-28 10:10:47,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:47,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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 35 [2022-04-28 10:10:47,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:47,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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:47,394 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:10:47,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:10:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:10:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:10:47,394 INFO L87 Difference]: Start difference. First operand 398 states and 529 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:51,438 INFO L93 Difference]: Finished difference Result 660 states and 875 transitions. [2022-04-28 10:10:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:10:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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 35 [2022-04-28 10:10:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-28 10:10:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-28 10:10:51,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-28 10:10:51,503 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:10:51,515 INFO L225 Difference]: With dead ends: 660 [2022-04-28 10:10:51,515 INFO L226 Difference]: Without dead ends: 533 [2022-04-28 10:10:51,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 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:10:51,515 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:51,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:10:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-04-28 10:10:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 382. [2022-04-28 10:10:53,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:53,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 533 states. Second operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,467 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,467 INFO L87 Difference]: Start difference. First operand 533 states. Second operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,476 INFO L93 Difference]: Finished difference Result 533 states and 704 transitions. [2022-04-28 10:10:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 704 transitions. [2022-04-28 10:10:53,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 533 states. [2022-04-28 10:10:53,477 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 533 states. [2022-04-28 10:10:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:53,486 INFO L93 Difference]: Finished difference Result 533 states and 704 transitions. [2022-04-28 10:10:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 704 transitions. [2022-04-28 10:10:53,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:53,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:53,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:53,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 377 states have internal predecessors, (501), 3 states have call successors, (3), 3 states have call 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,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 505 transitions. [2022-04-28 10:10:53,493 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 505 transitions. Word has length 35 [2022-04-28 10:10:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:53,493 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 505 transitions. [2022-04-28 10:10:53,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 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:53,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 505 transitions. [2022-04-28 10:10:55,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 505 transitions. [2022-04-28 10:10:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:10:55,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:55,055 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:55,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:55,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:55,255 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:55,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1852705767, now seen corresponding path program 25 times [2022-04-28 10:10:55,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:55,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090312199] [2022-04-28 10:10:55,258 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:55,259 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1852705767, now seen corresponding path program 26 times [2022-04-28 10:10:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:55,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225465020] [2022-04-28 10:10:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {45817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {45802#true} assume true; {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45802#true} {45802#true} #94#return; {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {45802#true} call ULTIMATE.init(); {45817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:55,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {45817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {45802#true} assume true; {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45802#true} {45802#true} #94#return; {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {45802#true} call #t~ret17 := main(); {45802#true} is VALID [2022-04-28 10:10:55,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {45802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45807#(= main_~y~0 0)} is VALID [2022-04-28 10:10:55,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {45807#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45808#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:55,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {45808#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45809#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:55,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {45809#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45810#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:55,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {45810#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45811#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:55,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {45811#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45812#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:55,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {45812#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45814#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:55,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {45814#(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; {45815#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {45815#(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; {45816#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {45816#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {45803#false} assume !(~x~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {45803#false} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L272 TraceCheckUtils]: 31: Hoare triple {45803#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {45803#false} ~cond := #in~cond; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {45803#false} assume 0 == ~cond; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {45803#false} assume !false; {45803#false} is VALID [2022-04-28 10:10:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:55,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225465020] [2022-04-28 10:10:55,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225465020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:55,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72014645] [2022-04-28 10:10:55,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:55,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:55,395 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:10:55,409 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:10:55,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:55,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:55,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:10:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:55,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:55,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {45802#true} call ULTIMATE.init(); {45802#true} is VALID [2022-04-28 10:10:55,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {45802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45802#true} is VALID [2022-04-28 10:10:55,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {45802#true} assume true; {45802#true} is VALID [2022-04-28 10:10:55,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45802#true} {45802#true} #94#return; {45802#true} is VALID [2022-04-28 10:10:55,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {45802#true} call #t~ret17 := main(); {45802#true} is VALID [2022-04-28 10:10:55,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {45802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45807#(= main_~y~0 0)} is VALID [2022-04-28 10:10:55,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {45807#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45808#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:55,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {45808#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45809#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:55,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {45809#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45810#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:55,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {45810#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45811#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:55,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {45811#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45812#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:55,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {45812#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:55,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {45813#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45814#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:55,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {45814#(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; {45815#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {45815#(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; {45866#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {45866#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {45803#false} assume !(~x~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {45803#false} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L272 TraceCheckUtils]: 31: Hoare triple {45803#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {45803#false} ~cond := #in~cond; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {45803#false} assume 0 == ~cond; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {45803#false} assume !false; {45803#false} is VALID [2022-04-28 10:10:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:55,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:55,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {45803#false} assume !false; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {45803#false} assume 0 == ~cond; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {45803#false} ~cond := #in~cond; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L272 TraceCheckUtils]: 31: Hoare triple {45803#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {45803#false} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {45803#false} assume !(~x~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {45803#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {45803#false} assume !(~y~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {45803#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45803#false} is VALID [2022-04-28 10:10:55,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {45978#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45803#false} is VALID [2022-04-28 10:10:55,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {45982#(< 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; {45978#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:55,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {45986#(< 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; {45982#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:55,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {45990#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {45986#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:55,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {45990#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45990#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:55,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {45997#(< 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; {45990#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:55,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {46001#(< 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; {45997#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:55,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {46005#(< 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; {46001#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:55,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {46009#(< 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; {46005#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:55,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {46013#(< 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; {46009#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:55,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {46017#(< 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; {46013#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:55,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {45802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46017#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:55,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {45802#true} call #t~ret17 := main(); {45802#true} is VALID [2022-04-28 10:10:55,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45802#true} {45802#true} #94#return; {45802#true} is VALID [2022-04-28 10:10:55,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {45802#true} assume true; {45802#true} is VALID [2022-04-28 10:10:55,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {45802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45802#true} is VALID [2022-04-28 10:10:55,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {45802#true} call ULTIMATE.init(); {45802#true} is VALID [2022-04-28 10:10:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:10:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72014645] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:55,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:10:55,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:55,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090312199] [2022-04-28 10:10:55,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090312199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:55,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:55,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:10:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147759357] [2022-04-28 10:10:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:55,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:55,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:55,894 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:10:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:10:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:10:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:10:55,895 INFO L87 Difference]: Start difference. First operand 382 states and 505 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:59,060 INFO L93 Difference]: Finished difference Result 465 states and 610 transitions. [2022-04-28 10:10:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:10:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2022-04-28 10:10:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:10:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2022-04-28 10:10:59,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 104 transitions. [2022-04-28 10:10:59,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:59,145 INFO L225 Difference]: With dead ends: 465 [2022-04-28 10:10:59,145 INFO L226 Difference]: Without dead ends: 443 [2022-04-28 10:10:59,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:10:59,146 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:59,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 86 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-28 10:11:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 382. [2022-04-28 10:11:01,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:01,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call 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:01,062 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call 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:01,063 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call 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:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:01,069 INFO L93 Difference]: Finished difference Result 443 states and 585 transitions. [2022-04-28 10:11:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 585 transitions. [2022-04-28 10:11:01,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:01,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:01,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 10:11:01,070 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 10:11:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:01,077 INFO L93 Difference]: Finished difference Result 443 states and 585 transitions. [2022-04-28 10:11:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 585 transitions. [2022-04-28 10:11:01,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:01,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:01,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:01,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 377 states have internal predecessors, (500), 3 states have call successors, (3), 3 states have call 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:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 504 transitions. [2022-04-28 10:11:01,087 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 504 transitions. Word has length 35 [2022-04-28 10:11:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:01,087 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 504 transitions. [2022-04-28 10:11:01,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:11:01,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 504 transitions. [2022-04-28 10:11:02,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 504 transitions. [2022-04-28 10:11:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:11:02,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:02,629 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:02,645 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:11:02,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:02,830 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -945572984, now seen corresponding path program 19 times [2022-04-28 10:11:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [600342600] [2022-04-28 10:11:02,832 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:02,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -945572984, now seen corresponding path program 20 times [2022-04-28 10:11:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:02,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147042880] [2022-04-28 10:11:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:03,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {48662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48644#true} is VALID [2022-04-28 10:11:03,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {48644#true} assume true; {48644#true} is VALID [2022-04-28 10:11:03,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48644#true} {48644#true} #94#return; {48644#true} is VALID [2022-04-28 10:11:03,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {48644#true} call ULTIMATE.init(); {48662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:03,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {48662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48644#true} is VALID [2022-04-28 10:11:03,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {48644#true} assume true; {48644#true} is VALID [2022-04-28 10:11:03,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48644#true} {48644#true} #94#return; {48644#true} is VALID [2022-04-28 10:11:03,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {48644#true} call #t~ret17 := main(); {48644#true} is VALID [2022-04-28 10:11:03,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {48644#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48649#(= main_~y~0 0)} is VALID [2022-04-28 10:11:03,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {48649#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48650#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:03,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {48650#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48651#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:03,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {48651#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48652#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:03,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {48652#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48653#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:03,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {48653#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48654#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:03,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {48654#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48655#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:03,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {48655#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48655#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:03,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {48655#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {48656#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:03,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {48656#(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; {48657#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:03,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {48657#(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; {48658#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:03,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {48658#(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; {48659#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:03,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {48659#(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; {48660#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:03,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {48660#(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; {48661#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:03,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {48661#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {48645#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {48645#false} assume !(~y~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {48645#false} assume !(~x~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {48645#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {48645#false} assume !(~z~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {48645#false} assume !(~y~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L272 TraceCheckUtils]: 31: Hoare triple {48645#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {48645#false} ~cond := #in~cond; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {48645#false} assume 0 == ~cond; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {48645#false} assume !false; {48645#false} is VALID [2022-04-28 10:11:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:11:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147042880] [2022-04-28 10:11:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147042880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418639790] [2022-04-28 10:11:03,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:03,035 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:11:03,036 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:11:03,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:03,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:11:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:03,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:03,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {48644#true} call ULTIMATE.init(); {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {48644#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {48644#true} assume true; {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48644#true} {48644#true} #94#return; {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {48644#true} call #t~ret17 := main(); {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {48644#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48644#true} is VALID [2022-04-28 10:11:03,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {48644#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48644#true} is VALID [2022-04-28 10:11:03,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {48644#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:03,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {48687#(< 0 (mod (+ main_~x~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; {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:03,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:03,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {48695#(< 0 (mod (+ main_~x~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; {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:03,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {48699#(< 0 (mod (+ main_~x~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; {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {48703#(< 0 (mod (+ 5 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; {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:03,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:03,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:03,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:03,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {48645#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {48645#false} assume !(~z~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {48645#false} assume !(~y~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L272 TraceCheckUtils]: 31: Hoare triple {48645#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {48645#false} ~cond := #in~cond; {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {48645#false} assume 0 == ~cond; {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {48645#false} assume !false; {48645#false} is VALID [2022-04-28 10:11:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:11:03,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:03,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {48645#false} assume !false; {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {48645#false} assume 0 == ~cond; {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {48645#false} ~cond := #in~cond; {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L272 TraceCheckUtils]: 31: Hoare triple {48645#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {48645#false} assume !(~y~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {48645#false} assume !(~z~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {48645#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {48645#false} is VALID [2022-04-28 10:11:03,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {48725#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48725#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:03,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:03,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:03,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:03,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {48703#(< 0 (mod (+ 5 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; {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:03,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {48699#(< 0 (mod (+ main_~x~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; {48703#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:03,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {48695#(< 0 (mod (+ main_~x~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; {48699#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:03,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48695#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:03,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {48687#(< 0 (mod (+ main_~x~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; {48691#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:03,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {48644#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48687#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:03,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {48644#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48644#true} is VALID [2022-04-28 10:11:03,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {48644#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48644#true} is VALID [2022-04-28 10:11:03,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {48644#true} call #t~ret17 := main(); {48644#true} is VALID [2022-04-28 10:11:03,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48644#true} {48644#true} #94#return; {48644#true} is VALID [2022-04-28 10:11:03,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {48644#true} assume true; {48644#true} is VALID [2022-04-28 10:11:03,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {48644#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48644#true} is VALID [2022-04-28 10:11:03,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {48644#true} call ULTIMATE.init(); {48644#true} is VALID [2022-04-28 10:11:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 10:11:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418639790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:03,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:03,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-28 10:11:03,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:03,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [600342600] [2022-04-28 10:11:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [600342600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:03,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:03,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:11:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122251673] [2022-04-28 10:11:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 35 [2022-04-28 10:11:03,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:03,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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:11:03,402 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:11:03,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:11:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:11:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:11:03,403 INFO L87 Difference]: Start difference. First operand 382 states and 504 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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:11:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:07,205 INFO L93 Difference]: Finished difference Result 519 states and 705 transitions. [2022-04-28 10:11:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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 35 [2022-04-28 10:11:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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:11:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2022-04-28 10:11:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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:11:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2022-04-28 10:11:07,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 113 transitions. [2022-04-28 10:11:07,295 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:11:07,307 INFO L225 Difference]: With dead ends: 519 [2022-04-28 10:11:07,307 INFO L226 Difference]: Without dead ends: 422 [2022-04-28 10:11:07,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:11:07,308 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:07,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 108 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:11:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-28 10:11:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 383. [2022-04-28 10:11:09,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:09,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call 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:09,236 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call 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:09,236 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call 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:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:09,242 INFO L93 Difference]: Finished difference Result 422 states and 562 transitions. [2022-04-28 10:11:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 562 transitions. [2022-04-28 10:11:09,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:09,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:09,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 10:11:09,243 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 422 states. [2022-04-28 10:11:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:09,249 INFO L93 Difference]: Finished difference Result 422 states and 562 transitions. [2022-04-28 10:11:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 562 transitions. [2022-04-28 10:11:09,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:09,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:09,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:09,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 3 states have call successors, (3), 3 states have call 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:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 503 transitions. [2022-04-28 10:11:09,256 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 503 transitions. Word has length 35 [2022-04-28 10:11:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:09,256 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 503 transitions. [2022-04-28 10:11:09,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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:11:09,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 383 states and 503 transitions. [2022-04-28 10:11:10,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 503 transitions. [2022-04-28 10:11:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:11:10,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:10,862 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:10,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:11,075 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,SelfDestructingSolverStorable34 [2022-04-28 10:11:11,075 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2046463448, now seen corresponding path program 27 times [2022-04-28 10:11:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692720048] [2022-04-28 10:11:11,079 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:11,079 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2046463448, now seen corresponding path program 28 times [2022-04-28 10:11:11,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:11,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332462694] [2022-04-28 10:11:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:11,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:11,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {51592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {51570#true} assume true; {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51570#true} {51570#true} #94#return; {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {51570#true} call ULTIMATE.init(); {51592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:11,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {51592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {51570#true} assume true; {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51570#true} {51570#true} #94#return; {51570#true} is VALID [2022-04-28 10:11:11,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {51570#true} call #t~ret17 := main(); {51570#true} is VALID [2022-04-28 10:11:11,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {51570#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51575#(= main_~y~0 0)} is VALID [2022-04-28 10:11:11,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {51575#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:11,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {51576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:11,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {51577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:11,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {51578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:11,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {51579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:11,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {51580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:11,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {51581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:11,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {51582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:11,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {51583#(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; {51584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:11,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {51584#(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; {51585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:11,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {51585#(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; {51586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:11,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {51586#(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; {51587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:11,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {51587#(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; {51588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:11,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {51588#(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; {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:11,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:11,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {51590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {51590#(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; {51591#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {51591#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {51571#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {51571#false} assume !(~x~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {51571#false} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,345 INFO L272 TraceCheckUtils]: 31: Hoare triple {51571#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51571#false} is VALID [2022-04-28 10:11:11,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {51571#false} ~cond := #in~cond; {51571#false} is VALID [2022-04-28 10:11:11,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {51571#false} assume 0 == ~cond; {51571#false} is VALID [2022-04-28 10:11:11,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {51571#false} assume !false; {51571#false} is VALID [2022-04-28 10:11:11,346 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:11:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:11,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332462694] [2022-04-28 10:11:11,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332462694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:11,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389802100] [2022-04-28 10:11:11,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:11,347 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:11:11,349 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:11:11,387 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:11,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:11:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:11,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:11,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {51570#true} call ULTIMATE.init(); {51570#true} is VALID [2022-04-28 10:11:11,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {51570#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51570#true} is VALID [2022-04-28 10:11:11,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {51570#true} assume true; {51570#true} is VALID [2022-04-28 10:11:11,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51570#true} {51570#true} #94#return; {51570#true} is VALID [2022-04-28 10:11:11,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {51570#true} call #t~ret17 := main(); {51570#true} is VALID [2022-04-28 10:11:11,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {51570#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51575#(= main_~y~0 0)} is VALID [2022-04-28 10:11:11,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {51575#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:11,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {51576#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:11,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {51577#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:11,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {51578#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:11,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {51579#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:11,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {51580#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:11,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {51581#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:11,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {51582#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51583#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:11,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {51583#(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; {51584#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:11,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {51584#(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; {51585#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:11,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {51585#(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; {51586#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:11,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {51586#(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; {51587#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:11,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {51587#(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; {51588#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:11,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {51588#(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; {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:11,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:11,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {51589#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {51590#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:11:11,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {51590#(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; {51662#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {51662#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {51571#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {51571#false} assume !(~x~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {51571#false} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L272 TraceCheckUtils]: 31: Hoare triple {51571#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {51571#false} ~cond := #in~cond; {51571#false} is VALID [2022-04-28 10:11:11,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {51571#false} assume 0 == ~cond; {51571#false} is VALID [2022-04-28 10:11:11,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {51571#false} assume !false; {51571#false} is VALID [2022-04-28 10:11:11,659 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:11:11,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:12,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {51571#false} assume !false; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {51571#false} assume 0 == ~cond; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {51571#false} ~cond := #in~cond; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L272 TraceCheckUtils]: 31: Hoare triple {51571#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {51571#false} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {51571#false} assume !(~x~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {51571#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {51571#false} assume !(~y~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {51571#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51571#false} is VALID [2022-04-28 10:11:12,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {51732#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51571#false} is VALID [2022-04-28 10:11:12,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {51736#(< 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; {51732#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:12,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {51740#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {51736#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {51740#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {51740#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {51747#(< 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; {51740#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:12,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {51751#(< 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; {51747#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:12,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {51755#(< 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; {51751#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:12,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {51759#(< 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; {51755#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:12,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {51763#(< 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; {51759#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:12,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {51767#(< 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; {51763#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:12,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {51771#(< 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; {51767#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:12,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {51775#(< 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; {51771#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:12,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {51779#(< 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; {51775#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:12,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {51783#(< 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; {51779#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:12,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {51787#(< 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; {51783#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:12,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {51791#(< 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; {51787#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:12,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {51795#(< 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; {51791#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:12,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {51799#(< 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; {51795#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:12,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {51570#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51799#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:12,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {51570#true} call #t~ret17 := main(); {51570#true} is VALID [2022-04-28 10:11:12,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51570#true} {51570#true} #94#return; {51570#true} is VALID [2022-04-28 10:11:12,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {51570#true} assume true; {51570#true} is VALID [2022-04-28 10:11:12,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {51570#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51570#true} is VALID [2022-04-28 10:11:12,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {51570#true} call ULTIMATE.init(); {51570#true} is VALID [2022-04-28 10:11:12,161 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:11:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389802100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:12,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:11:12,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:12,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692720048] [2022-04-28 10:11:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692720048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:12,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:11:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425180025] [2022-04-28 10:11:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 10:11:12,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:12,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:12,181 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:12,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:11:12,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:11:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:11:12,182 INFO L87 Difference]: Start difference. First operand 383 states and 503 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:18,670 INFO L93 Difference]: Finished difference Result 667 states and 1012 transitions. [2022-04-28 10:11:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:11:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 10:11:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 218 transitions. [2022-04-28 10:11:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 218 transitions. [2022-04-28 10:11:18,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 218 transitions. [2022-04-28 10:11:18,830 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:11:18,848 INFO L225 Difference]: With dead ends: 667 [2022-04-28 10:11:18,848 INFO L226 Difference]: Without dead ends: 629 [2022-04-28 10:11:18,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=658, Invalid=2422, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:11:18,849 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 167 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:18,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 168 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:11:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-04-28 10:11:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 406. [2022-04-28 10:11:20,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:20,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 629 states. Second operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call 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,880 INFO L74 IsIncluded]: Start isIncluded. First operand 629 states. Second operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call 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,880 INFO L87 Difference]: Start difference. First operand 629 states. Second operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call 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,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:20,892 INFO L93 Difference]: Finished difference Result 629 states and 839 transitions. [2022-04-28 10:11:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 839 transitions. [2022-04-28 10:11:20,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:20,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:20,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 629 states. [2022-04-28 10:11:20,894 INFO L87 Difference]: Start difference. First operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 629 states. [2022-04-28 10:11:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:20,908 INFO L93 Difference]: Finished difference Result 629 states and 839 transitions. [2022-04-28 10:11:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 839 transitions. [2022-04-28 10:11:20,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:20,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:20,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:20,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3241895261845387) internal successors, (531), 401 states have internal predecessors, (531), 3 states have call successors, (3), 3 states have call 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,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 535 transitions. [2022-04-28 10:11:20,918 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 535 transitions. Word has length 35 [2022-04-28 10:11:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:20,918 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 535 transitions. [2022-04-28 10:11:20,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:11:20,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 406 states and 535 transitions. [2022-04-28 10:11:22,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 535 transitions. [2022-04-28 10:11:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:22,910 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:22,910 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:22,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:23,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:11:23,111 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -224601084, now seen corresponding path program 21 times [2022-04-28 10:11:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:23,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277288604] [2022-04-28 10:11:23,114 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:23,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash -224601084, now seen corresponding path program 22 times [2022-04-28 10:11:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:23,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574069732] [2022-04-28 10:11:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:23,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:23,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {55280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55260#true} is VALID [2022-04-28 10:11:23,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {55260#true} assume true; {55260#true} is VALID [2022-04-28 10:11:23,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55260#true} {55260#true} #94#return; {55260#true} is VALID [2022-04-28 10:11:23,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {55260#true} call ULTIMATE.init(); {55280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:23,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {55280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55260#true} is VALID [2022-04-28 10:11:23,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {55260#true} assume true; {55260#true} is VALID [2022-04-28 10:11:23,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55260#true} {55260#true} #94#return; {55260#true} is VALID [2022-04-28 10:11:23,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {55260#true} call #t~ret17 := main(); {55260#true} is VALID [2022-04-28 10:11:23,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {55260#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55265#(= main_~y~0 0)} is VALID [2022-04-28 10:11:23,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {55265#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55266#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:23,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {55266#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55267#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:23,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {55267#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55268#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:23,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {55268#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55269#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:23,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {55269#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55270#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:23,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {55270#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55271#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:23,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {55271#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55271#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:23,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {55271#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:23,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {55272#(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; {55273#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:23,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {55273#(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; {55274#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:23,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {55274#(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; {55275#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:23,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {55275#(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; {55276#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:23,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {55276#(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; {55277#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:23,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {55277#(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; {55278#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:23,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {55278#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55278#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:11:23,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {55278#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55277#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:11:23,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {55277#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55276#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:23,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {55276#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55275#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:23,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {55275#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55274#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:23,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {55274#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55273#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:23,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {55273#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:23,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:23,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:23,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {55272#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {55279#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:23,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {55279#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {55261#false} assume !(~y~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,368 INFO L272 TraceCheckUtils]: 32: Hoare triple {55261#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55261#false} is VALID [2022-04-28 10:11:23,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {55261#false} ~cond := #in~cond; {55261#false} is VALID [2022-04-28 10:11:23,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {55261#false} assume 0 == ~cond; {55261#false} is VALID [2022-04-28 10:11:23,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {55261#false} assume !false; {55261#false} is VALID [2022-04-28 10:11:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:23,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574069732] [2022-04-28 10:11:23,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574069732] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:23,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955957316] [2022-04-28 10:11:23,369 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:23,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:23,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:23,370 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:11:23,371 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:11:23,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:23,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:23,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:11:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:23,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {55260#true} call ULTIMATE.init(); {55260#true} is VALID [2022-04-28 10:11:23,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {55260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55260#true} is VALID [2022-04-28 10:11:23,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {55260#true} assume true; {55260#true} is VALID [2022-04-28 10:11:23,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55260#true} {55260#true} #94#return; {55260#true} is VALID [2022-04-28 10:11:23,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {55260#true} call #t~ret17 := main(); {55260#true} is VALID [2022-04-28 10:11:23,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {55260#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55260#true} is VALID [2022-04-28 10:11:23,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {55260#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {55302#(< 0 (mod (+ main_~x~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; {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {55310#(< 0 (mod (+ main_~x~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; {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {55314#(< 0 (mod (+ main_~x~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; {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {55318#(< 0 (mod (+ 5 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; {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {55261#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {55261#false} assume !(~z~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {55261#false} assume !(~y~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L272 TraceCheckUtils]: 32: Hoare triple {55261#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {55261#false} ~cond := #in~cond; {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {55261#false} assume 0 == ~cond; {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {55261#false} assume !false; {55261#false} is VALID [2022-04-28 10:11:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:11:23,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {55261#false} assume !false; {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {55261#false} assume 0 == ~cond; {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {55261#false} ~cond := #in~cond; {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L272 TraceCheckUtils]: 32: Hoare triple {55261#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {55261#false} assume !(~y~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {55261#false} assume !(~z~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {55261#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {55261#false} is VALID [2022-04-28 10:11:23,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {55261#false} is VALID [2022-04-28 10:11:23,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55347#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:11:23,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {55318#(< 0 (mod (+ 5 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; {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55322#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:11:23,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {55314#(< 0 (mod (+ main_~x~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; {55318#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:11:23,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {55310#(< 0 (mod (+ main_~x~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; {55314#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:11:23,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55310#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:11:23,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {55302#(< 0 (mod (+ main_~x~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; {55306#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:11:23,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {55260#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55302#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:11:23,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {55260#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55260#true} is VALID [2022-04-28 10:11:23,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {55260#true} call #t~ret17 := main(); {55260#true} is VALID [2022-04-28 10:11:23,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55260#true} {55260#true} #94#return; {55260#true} is VALID [2022-04-28 10:11:23,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {55260#true} assume true; {55260#true} is VALID [2022-04-28 10:11:23,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {55260#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55260#true} is VALID [2022-04-28 10:11:23,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {55260#true} call ULTIMATE.init(); {55260#true} is VALID [2022-04-28 10:11:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:11:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955957316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:23,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:11:23,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277288604] [2022-04-28 10:11:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277288604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:11:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909579916] [2022-04-28 10:11:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:23,787 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:11:23,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:23,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 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:23,811 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:23,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:11:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:23,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:11:23,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:11:23,812 INFO L87 Difference]: Start difference. First operand 406 states and 535 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 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:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:31,197 INFO L93 Difference]: Finished difference Result 645 states and 945 transitions. [2022-04-28 10:11:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 10:11:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:11:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 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:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 250 transitions. [2022-04-28 10:11:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 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:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 250 transitions. [2022-04-28 10:11:31,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 250 transitions. [2022-04-28 10:11:31,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:31,407 INFO L225 Difference]: With dead ends: 645 [2022-04-28 10:11:31,407 INFO L226 Difference]: Without dead ends: 566 [2022-04-28 10:11:31,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=7192, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:11:31,408 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:31,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 106 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:11:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-04-28 10:11:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 445. [2022-04-28 10:11:33,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:33,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call 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:33,799 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call 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:33,799 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call 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:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:33,809 INFO L93 Difference]: Finished difference Result 566 states and 711 transitions. [2022-04-28 10:11:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 711 transitions. [2022-04-28 10:11:33,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:33,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:33,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 566 states. [2022-04-28 10:11:33,810 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 566 states. [2022-04-28 10:11:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:33,819 INFO L93 Difference]: Finished difference Result 566 states and 711 transitions. [2022-04-28 10:11:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 711 transitions. [2022-04-28 10:11:33,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:33,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:33,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:33,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.3295454545454546) internal successors, (585), 440 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call 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:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 589 transitions. [2022-04-28 10:11:33,828 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 589 transitions. Word has length 36 [2022-04-28 10:11:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:33,828 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 589 transitions. [2022-04-28 10:11:33,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 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:33,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 445 states and 589 transitions. [2022-04-28 10:11:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 589 transitions. [2022-04-28 10:11:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:11:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:35,939 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:35,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:36,140 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 824480069, now seen corresponding path program 29 times [2022-04-28 10:11:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:36,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689279524] [2022-04-28 10:11:36,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:36,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash 824480069, now seen corresponding path program 30 times [2022-04-28 10:11:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:36,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152721788] [2022-04-28 10:11:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:36,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {58964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58941#true} is VALID [2022-04-28 10:11:36,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {58941#true} assume true; {58941#true} is VALID [2022-04-28 10:11:36,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58941#true} {58941#true} #94#return; {58941#true} is VALID [2022-04-28 10:11:36,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {58941#true} call ULTIMATE.init(); {58964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:36,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {58964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58941#true} is VALID [2022-04-28 10:11:36,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {58941#true} assume true; {58941#true} is VALID [2022-04-28 10:11:36,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58941#true} {58941#true} #94#return; {58941#true} is VALID [2022-04-28 10:11:36,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {58941#true} call #t~ret17 := main(); {58941#true} is VALID [2022-04-28 10:11:36,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {58941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58946#(= main_~y~0 0)} is VALID [2022-04-28 10:11:36,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {58946#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:36,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {58947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:36,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {58948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:36,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {58949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:36,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {58950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:36,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {58951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:36,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {58952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:36,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {58953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:36,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {58954#(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; {58955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:36,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {58955#(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; {58956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:36,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {58956#(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; {58957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:36,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {58957#(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; {58958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:36,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {58958#(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; {58959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:36,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {58959#(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; {58960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:36,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {58960#(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; {58961#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:36,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {58961#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58961#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:36,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {58961#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {58962#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:11:36,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {58962#(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; {58963#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:36,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {58963#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {58942#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58942#false} is VALID [2022-04-28 10:11:36,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {58942#false} assume !(~y~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {58942#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {58942#false} assume !(~x~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {58942#false} assume !(~z~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {58942#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {58942#false} assume !(~y~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L272 TraceCheckUtils]: 32: Hoare triple {58942#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {58942#false} ~cond := #in~cond; {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {58942#false} assume 0 == ~cond; {58942#false} is VALID [2022-04-28 10:11:36,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {58942#false} assume !false; {58942#false} is VALID [2022-04-28 10:11:36,420 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:11:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152721788] [2022-04-28 10:11:36,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152721788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674039749] [2022-04-28 10:11:36,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:36,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:36,421 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:11:36,422 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:11:36,455 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:11:36,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:36,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:11:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:36,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {58941#true} call ULTIMATE.init(); {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {58941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {58941#true} assume true; {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58941#true} {58941#true} #94#return; {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {58941#true} call #t~ret17 := main(); {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {58941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {58941#true} assume !(~x~0 % 4294967296 > 0); {58941#true} is VALID [2022-04-28 10:11:36,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {58941#true} ~z~0 := ~y~0; {58941#true} is VALID [2022-04-28 10:11:36,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {58941#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:11:36,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:11:36,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {58942#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {58942#false} assume !(~y~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L272 TraceCheckUtils]: 32: Hoare triple {58942#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {58942#false} ~cond := #in~cond; {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {58942#false} assume 0 == ~cond; {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {58942#false} assume !false; {58942#false} is VALID [2022-04-28 10:11:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 10:11:36,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:36,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {58942#false} assume !false; {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {58942#false} assume 0 == ~cond; {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {58942#false} ~cond := #in~cond; {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L272 TraceCheckUtils]: 32: Hoare triple {58942#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {58942#false} assume !(~y~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {58942#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58942#false} is VALID [2022-04-28 10:11:36,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {59044#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59044#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:11:36,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {58941#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59037#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:11:36,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {58941#true} ~z~0 := ~y~0; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {58941#true} assume !(~x~0 % 4294967296 > 0); {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {58941#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {58941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58941#true} is VALID [2022-04-28 10:11:36,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {58941#true} call #t~ret17 := main(); {58941#true} is VALID [2022-04-28 10:11:36,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58941#true} {58941#true} #94#return; {58941#true} is VALID [2022-04-28 10:11:36,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {58941#true} assume true; {58941#true} is VALID [2022-04-28 10:11:36,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {58941#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {58941#true} is VALID [2022-04-28 10:11:36,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {58941#true} call ULTIMATE.init(); {58941#true} is VALID [2022-04-28 10:11:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-04-28 10:11:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674039749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:36,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 4, 4] total 23 [2022-04-28 10:11:36,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:36,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689279524] [2022-04-28 10:11:36,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689279524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:36,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:36,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:11:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063329632] [2022-04-28 10:11:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:36,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:11:36,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:36,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:36,651 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:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:11:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:11:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:11:36,652 INFO L87 Difference]: Start difference. First operand 445 states and 589 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:44,225 INFO L93 Difference]: Finished difference Result 746 states and 1130 transitions. [2022-04-28 10:11:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:11:44,225 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 10:11:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 231 transitions. [2022-04-28 10:11:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 231 transitions. [2022-04-28 10:11:44,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 231 transitions. [2022-04-28 10:11:44,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:44,415 INFO L225 Difference]: With dead ends: 746 [2022-04-28 10:11:44,415 INFO L226 Difference]: Without dead ends: 708 [2022-04-28 10:11:44,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:11:44,416 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 180 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:44,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 179 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 10:11:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-04-28 10:11:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 470. [2022-04-28 10:11:46,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:46,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call 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:46,956 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call 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:46,956 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call 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:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:46,970 INFO L93 Difference]: Finished difference Result 708 states and 949 transitions. [2022-04-28 10:11:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 949 transitions. [2022-04-28 10:11:46,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:46,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:46,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 708 states. [2022-04-28 10:11:46,972 INFO L87 Difference]: Start difference. First operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 708 states. [2022-04-28 10:11:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:46,985 INFO L93 Difference]: Finished difference Result 708 states and 949 transitions. [2022-04-28 10:11:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 949 transitions. [2022-04-28 10:11:46,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:46,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:46,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:46,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 465 states have (on average 1.3333333333333333) internal successors, (620), 465 states have internal predecessors, (620), 3 states have call successors, (3), 3 states have call 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:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 624 transitions. [2022-04-28 10:11:46,999 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 624 transitions. Word has length 36 [2022-04-28 10:11:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:46,999 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 624 transitions. [2022-04-28 10:11:47,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:47,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 624 transitions. [2022-04-28 10:11:49,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 624 transitions. [2022-04-28 10:11:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:11:49,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:49,238 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:49,254 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:11:49,438 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,SelfDestructingSolverStorable37 [2022-04-28 10:11:49,439 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 23 times [2022-04-28 10:11:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:49,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575995297] [2022-04-28 10:11:49,441 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:49,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 972307160, now seen corresponding path program 24 times [2022-04-28 10:11:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:49,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793310365] [2022-04-28 10:11:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {63083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63068#true} is VALID [2022-04-28 10:11:49,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {63068#true} assume true; {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63068#true} {63068#true} #94#return; {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {63068#true} call ULTIMATE.init(); {63083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {63083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {63068#true} assume true; {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63068#true} {63068#true} #94#return; {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {63068#true} call #t~ret17 := main(); {63068#true} is VALID [2022-04-28 10:11:49,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {63068#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63068#true} is VALID [2022-04-28 10:11:49,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {63068#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:49,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63074#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:11:49,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {63074#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63075#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:49,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {63075#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63076#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:49,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {63076#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:49,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:49,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:11:49,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {63077#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63078#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:11:49,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {63078#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63079#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-28 10:11:49,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {63079#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63080#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:11:49,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {63080#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63081#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:11:49,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {63081#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {63082#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {63069#false} assume !(~z~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {63069#false} assume !(~y~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L272 TraceCheckUtils]: 33: Hoare triple {63069#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63069#false} is VALID [2022-04-28 10:11:49,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {63069#false} ~cond := #in~cond; {63069#false} is VALID [2022-04-28 10:11:49,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {63069#false} assume 0 == ~cond; {63069#false} is VALID [2022-04-28 10:11:49,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {63069#false} assume !false; {63069#false} is VALID [2022-04-28 10:11:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793310365] [2022-04-28 10:11:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793310365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965052537] [2022-04-28 10:11:49,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:49,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:49,606 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:11:49,606 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:11:49,665 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:11:49,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:49,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:11:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:49,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:50,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {63068#true} call ULTIMATE.init(); {63068#true} is VALID [2022-04-28 10:11:50,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {63068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63068#true} is VALID [2022-04-28 10:11:50,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {63068#true} assume true; {63068#true} is VALID [2022-04-28 10:11:50,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63068#true} {63068#true} #94#return; {63068#true} is VALID [2022-04-28 10:11:50,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {63068#true} call #t~ret17 := main(); {63068#true} is VALID [2022-04-28 10:11:50,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {63068#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63068#true} is VALID [2022-04-28 10:11:50,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {63068#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:50,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:50,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:50,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:50,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:50,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:50,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {63069#false} assume !(~z~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {63069#false} assume !(~y~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L272 TraceCheckUtils]: 33: Hoare triple {63069#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {63069#false} ~cond := #in~cond; {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {63069#false} assume 0 == ~cond; {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {63069#false} assume !false; {63069#false} is VALID [2022-04-28 10:11:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:50,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:50,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {63069#false} assume !false; {63069#false} is VALID [2022-04-28 10:11:50,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {63069#false} assume 0 == ~cond; {63069#false} is VALID [2022-04-28 10:11:50,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {63069#false} ~cond := #in~cond; {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L272 TraceCheckUtils]: 33: Hoare triple {63069#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {63069#false} assume !(~y~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {63069#false} assume !(~z~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {63069#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {63069#false} is VALID [2022-04-28 10:11:50,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {63069#false} is VALID [2022-04-28 10:11:50,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63142#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:50,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:50,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:50,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63120#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63116#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:11:50,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63112#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:11:50,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63108#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:11:50,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {63068#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {63073#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:11:50,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {63068#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63068#true} is VALID [2022-04-28 10:11:50,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {63068#true} call #t~ret17 := main(); {63068#true} is VALID [2022-04-28 10:11:50,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63068#true} {63068#true} #94#return; {63068#true} is VALID [2022-04-28 10:11:50,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {63068#true} assume true; {63068#true} is VALID [2022-04-28 10:11:50,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {63068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {63068#true} is VALID [2022-04-28 10:11:50,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {63068#true} call ULTIMATE.init(); {63068#true} is VALID [2022-04-28 10:11:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:11:50,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965052537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:50,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:50,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-28 10:11:50,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:50,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575995297] [2022-04-28 10:11:50,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575995297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:50,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:50,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:11:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158043735] [2022-04-28 10:11:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:11:50,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:50,407 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), 12 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:11:50,428 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:11:50,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:11:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:50,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:11:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:11:50,428 INFO L87 Difference]: Start difference. First operand 470 states and 624 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:11:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:57,894 INFO L93 Difference]: Finished difference Result 911 states and 1204 transitions. [2022-04-28 10:11:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:11:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:11:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:11:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-28 10:11:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:11:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2022-04-28 10:11:57,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2022-04-28 10:11:57,990 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:11:58,019 INFO L225 Difference]: With dead ends: 911 [2022-04-28 10:11:58,019 INFO L226 Difference]: Without dead ends: 846 [2022-04-28 10:11:58,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:11:58,020 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 96 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:58,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 68 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-04-28 10:12:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 504. [2022-04-28 10:12:01,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:01,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 846 states. Second operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call 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:01,003 INFO L74 IsIncluded]: Start isIncluded. First operand 846 states. Second operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call 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:01,004 INFO L87 Difference]: Start difference. First operand 846 states. Second operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call 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:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:01,024 INFO L93 Difference]: Finished difference Result 846 states and 1105 transitions. [2022-04-28 10:12:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1105 transitions. [2022-04-28 10:12:01,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:01,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 846 states. [2022-04-28 10:12:01,025 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 846 states. [2022-04-28 10:12:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:01,047 INFO L93 Difference]: Finished difference Result 846 states and 1105 transitions. [2022-04-28 10:12:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1105 transitions. [2022-04-28 10:12:01,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:01,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:01,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:01,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.3226452905811623) internal successors, (660), 499 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call 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:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 664 transitions. [2022-04-28 10:12:01,058 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 664 transitions. Word has length 37 [2022-04-28 10:12:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:01,059 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 664 transitions. [2022-04-28 10:12:01,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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:12:01,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 664 transitions. [2022-04-28 10:12:04,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 664 edges. 664 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 664 transitions. [2022-04-28 10:12:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:04,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:04,214 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:04,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:04,414 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,SelfDestructingSolverStorable38 [2022-04-28 10:12:04,415 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash 397617959, now seen corresponding path program 31 times [2022-04-28 10:12:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:04,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650042823] [2022-04-28 10:12:04,417 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:04,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 397617959, now seen corresponding path program 32 times [2022-04-28 10:12:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890973002] [2022-04-28 10:12:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:04,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {67868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67852#true} is VALID [2022-04-28 10:12:04,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {67852#true} assume true; {67852#true} is VALID [2022-04-28 10:12:04,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67852#true} {67852#true} #94#return; {67852#true} is VALID [2022-04-28 10:12:04,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {67852#true} call ULTIMATE.init(); {67868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:04,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {67868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67852#true} is VALID [2022-04-28 10:12:04,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {67852#true} assume true; {67852#true} is VALID [2022-04-28 10:12:04,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67852#true} {67852#true} #94#return; {67852#true} is VALID [2022-04-28 10:12:04,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {67852#true} call #t~ret17 := main(); {67852#true} is VALID [2022-04-28 10:12:04,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {67852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67857#(= main_~y~0 0)} is VALID [2022-04-28 10:12:04,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {67857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:04,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {67858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:04,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {67859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:04,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {67860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:04,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {67861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:04,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {67862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:04,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {67863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#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#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:04,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:04,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {67865#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:04,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {67865#(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; {67866#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {67866#(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; {67867#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {67867#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {67853#false} assume !(~x~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {67853#false} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L272 TraceCheckUtils]: 33: Hoare triple {67853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {67853#false} ~cond := #in~cond; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {67853#false} assume 0 == ~cond; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {67853#false} assume !false; {67853#false} is VALID [2022-04-28 10:12:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:12:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890973002] [2022-04-28 10:12:04,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890973002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:04,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371253343] [2022-04-28 10:12:04,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:04,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:04,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:04,569 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:12:04,569 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:12:04,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:04,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:04,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:12:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:04,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:04,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {67852#true} call ULTIMATE.init(); {67852#true} is VALID [2022-04-28 10:12:04,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {67852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67852#true} is VALID [2022-04-28 10:12:04,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {67852#true} assume true; {67852#true} is VALID [2022-04-28 10:12:04,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67852#true} {67852#true} #94#return; {67852#true} is VALID [2022-04-28 10:12:04,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {67852#true} call #t~ret17 := main(); {67852#true} is VALID [2022-04-28 10:12:04,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {67852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67857#(= main_~y~0 0)} is VALID [2022-04-28 10:12:04,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {67857#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:04,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {67858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:04,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {67859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:04,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {67860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:04,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {67861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:04,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {67862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:04,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {67863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#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#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:04,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:04,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {67864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {67865#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:04,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {67865#(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; {67866#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {67866#(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; {67920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {67920#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {67853#false} assume !(~x~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {67853#false} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L272 TraceCheckUtils]: 33: Hoare triple {67853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {67853#false} ~cond := #in~cond; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {67853#false} assume 0 == ~cond; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {67853#false} assume !false; {67853#false} is VALID [2022-04-28 10:12:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:12:04,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:05,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {67853#false} assume !false; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {67853#false} assume 0 == ~cond; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {67853#false} ~cond := #in~cond; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L272 TraceCheckUtils]: 33: Hoare triple {67853#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {67853#false} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {67853#false} assume !(~x~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {67853#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {67853#false} assume !(~y~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {67853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67853#false} is VALID [2022-04-28 10:12:05,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {68038#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67853#false} is VALID [2022-04-28 10:12:05,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {68042#(< 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; {68038#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:05,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {68046#(< 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; {68042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:05,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {68050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {68046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:05,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {68050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {68050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:05,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {68057#(< 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; {68050#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:05,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {68061#(< 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; {68057#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:05,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {68065#(< 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; {68061#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:05,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {68069#(< 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; {68065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:05,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {68073#(< 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; {68069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:05,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {68077#(< 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; {68073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:05,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {68081#(< 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; {68077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:05,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {67852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:05,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {67852#true} call #t~ret17 := main(); {67852#true} is VALID [2022-04-28 10:12:05,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67852#true} {67852#true} #94#return; {67852#true} is VALID [2022-04-28 10:12:05,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {67852#true} assume true; {67852#true} is VALID [2022-04-28 10:12:05,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {67852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67852#true} is VALID [2022-04-28 10:12:05,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {67852#true} call ULTIMATE.init(); {67852#true} is VALID [2022-04-28 10:12:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 10:12:05,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371253343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:05,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:05,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:12:05,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650042823] [2022-04-28 10:12:05,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650042823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:05,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:05,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:12:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850586473] [2022-04-28 10:12:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:05,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:05,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:05,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:05,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:12:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:12:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:12:05,121 INFO L87 Difference]: Start difference. First operand 504 states and 664 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:09,783 INFO L93 Difference]: Finished difference Result 607 states and 791 transitions. [2022-04-28 10:12:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:12:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-28 10:12:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-28 10:12:09,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 115 transitions. [2022-04-28 10:12:09,875 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:12:09,888 INFO L225 Difference]: With dead ends: 607 [2022-04-28 10:12:09,888 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 10:12:09,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:12:09,889 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 85 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 99 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 10:12:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 504. [2022-04-28 10:12:12,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:12,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call 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,849 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call 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,849 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call 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,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:12,860 INFO L93 Difference]: Finished difference Result 584 states and 765 transitions. [2022-04-28 10:12:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 765 transitions. [2022-04-28 10:12:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:12,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:12,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-28 10:12:12,861 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 584 states. [2022-04-28 10:12:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:12,870 INFO L93 Difference]: Finished difference Result 584 states and 765 transitions. [2022-04-28 10:12:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 765 transitions. [2022-04-28 10:12:12,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:12,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:12,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:12,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.3206412825651304) internal successors, (659), 499 states have internal predecessors, (659), 3 states have call successors, (3), 3 states have call 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,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 663 transitions. [2022-04-28 10:12:12,881 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 663 transitions. Word has length 37 [2022-04-28 10:12:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:12,881 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 663 transitions. [2022-04-28 10:12:12,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:12:12,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 663 transitions. [2022-04-28 10:12:16,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 663 transitions. [2022-04-28 10:12:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:12:16,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:16,192 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:16,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:16,393 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,SelfDestructingSolverStorable39 [2022-04-28 10:12:16,393 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash -370584120, now seen corresponding path program 33 times [2022-04-28 10:12:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1565946391] [2022-04-28 10:12:16,396 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:16,396 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash -370584120, now seen corresponding path program 34 times [2022-04-28 10:12:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:16,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401190614] [2022-04-28 10:12:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {71544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {71520#true} assume true; {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71520#true} {71520#true} #94#return; {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {71520#true} call ULTIMATE.init(); {71544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:16,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {71544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {71520#true} assume true; {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71520#true} {71520#true} #94#return; {71520#true} is VALID [2022-04-28 10:12:16,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {71520#true} call #t~ret17 := main(); {71520#true} is VALID [2022-04-28 10:12:16,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {71520#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71525#(= main_~y~0 0)} is VALID [2022-04-28 10:12:16,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {71525#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71526#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:16,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {71526#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71527#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:16,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {71527#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71528#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:16,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {71528#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71529#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:16,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {71529#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71530#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:16,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {71530#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71531#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:16,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {71531#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71532#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:16,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {71532#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71533#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:16,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {71533#(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; {71534#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:16,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {71534#(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; {71535#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:16,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {71535#(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; {71536#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:16,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {71536#(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; {71537#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:16,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {71537#(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; {71538#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:16,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {71538#(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; {71539#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:16,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {71539#(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; {71540#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:16,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {71540#(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; {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:16,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:16,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {71542#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:16,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {71542#(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; {71543#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {71543#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {71521#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {71521#false} assume !(~x~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {71521#false} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L272 TraceCheckUtils]: 33: Hoare triple {71521#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {71521#false} ~cond := #in~cond; {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {71521#false} assume 0 == ~cond; {71521#false} is VALID [2022-04-28 10:12:16,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {71521#false} assume !false; {71521#false} is VALID [2022-04-28 10:12:16,714 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:12:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:16,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401190614] [2022-04-28 10:12:16,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401190614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:16,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068518811] [2022-04-28 10:12:16,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:16,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:16,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:16,716 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:12:16,716 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:12:16,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:16,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:16,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:12:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:17,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {71520#true} call ULTIMATE.init(); {71520#true} is VALID [2022-04-28 10:12:17,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {71520#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71520#true} is VALID [2022-04-28 10:12:17,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {71520#true} assume true; {71520#true} is VALID [2022-04-28 10:12:17,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71520#true} {71520#true} #94#return; {71520#true} is VALID [2022-04-28 10:12:17,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {71520#true} call #t~ret17 := main(); {71520#true} is VALID [2022-04-28 10:12:17,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {71520#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71525#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {71525#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71526#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {71526#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71527#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {71527#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71528#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {71528#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71529#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {71529#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71530#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {71530#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71531#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {71531#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71532#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {71532#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {71533#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {71533#(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; {71534#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {71534#(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; {71535#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:17,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {71535#(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; {71536#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:17,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {71536#(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; {71537#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:17,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {71537#(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; {71538#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:17,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {71538#(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; {71539#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:17,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {71539#(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; {71540#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:17,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {71540#(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; {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:17,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:17,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {71541#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {71542#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:12:17,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {71542#(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; {71620#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {71620#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {71521#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {71521#false} assume !(~x~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {71521#false} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L272 TraceCheckUtils]: 33: Hoare triple {71521#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {71521#false} ~cond := #in~cond; {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {71521#false} assume 0 == ~cond; {71521#false} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {71521#false} assume !false; {71521#false} is VALID [2022-04-28 10:12:17,081 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:12:17,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:17,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {71521#false} assume !false; {71521#false} is VALID [2022-04-28 10:12:17,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {71521#false} assume 0 == ~cond; {71521#false} is VALID [2022-04-28 10:12:17,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {71521#false} ~cond := #in~cond; {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L272 TraceCheckUtils]: 33: Hoare triple {71521#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {71521#false} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {71521#false} assume !(~x~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {71521#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {71521#false} assume !(~y~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {71521#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71521#false} is VALID [2022-04-28 10:12:17,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {71690#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71521#false} is VALID [2022-04-28 10:12:17,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {71694#(< 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; {71690#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:17,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {71698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {71694#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:17,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {71698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {71698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:17,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {71705#(< 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; {71698#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:17,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {71709#(< 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; {71705#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:17,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {71713#(< 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; {71709#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:17,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {71717#(< 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; {71713#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:17,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {71721#(< 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; {71717#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:17,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {71725#(< 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; {71721#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:17,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {71729#(< 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; {71725#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:17,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {71733#(< 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; {71729#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:17,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {71737#(< 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; {71733#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:17,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {71741#(< 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; {71737#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:17,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {71745#(< 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; {71741#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:17,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {71749#(< 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; {71745#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:17,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {71753#(< 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; {71749#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:17,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {71757#(< 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; {71753#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:17,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {71761#(< 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; {71757#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:17,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {71765#(< 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; {71761#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:17,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {71520#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71765#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:17,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {71520#true} call #t~ret17 := main(); {71520#true} is VALID [2022-04-28 10:12:17,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71520#true} {71520#true} #94#return; {71520#true} is VALID [2022-04-28 10:12:17,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {71520#true} assume true; {71520#true} is VALID [2022-04-28 10:12:17,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {71520#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {71520#true} is VALID [2022-04-28 10:12:17,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {71520#true} call ULTIMATE.init(); {71520#true} is VALID [2022-04-28 10:12:17,662 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:12:17,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068518811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:17,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:17,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:12:17,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:17,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1565946391] [2022-04-28 10:12:17,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1565946391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:17,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:17,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:12:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16070554] [2022-04-28 10:12:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 10:12:17,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:17,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:17,686 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:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:12:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:12:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:12:17,688 INFO L87 Difference]: Start difference. First operand 504 states and 663 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:26,635 INFO L93 Difference]: Finished difference Result 845 states and 1276 transitions. [2022-04-28 10:12:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:12:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 10:12:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 244 transitions. [2022-04-28 10:12:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 244 transitions. [2022-04-28 10:12:26,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 244 transitions. [2022-04-28 10:12:26,819 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:12:26,849 INFO L225 Difference]: With dead ends: 845 [2022-04-28 10:12:26,849 INFO L226 Difference]: Without dead ends: 805 [2022-04-28 10:12:26,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:12:26,850 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 195 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:26,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 190 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:12:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-04-28 10:12:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 531. [2022-04-28 10:12:29,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:29,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 805 states. Second operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:29,970 INFO L74 IsIncluded]: Start isIncluded. First operand 805 states. Second operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:29,971 INFO L87 Difference]: Start difference. First operand 805 states. Second operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:29,990 INFO L93 Difference]: Finished difference Result 805 states and 1068 transitions. [2022-04-28 10:12:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1068 transitions. [2022-04-28 10:12:29,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:29,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:29,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 805 states. [2022-04-28 10:12:29,991 INFO L87 Difference]: Start difference. First operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 805 states. [2022-04-28 10:12:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:30,011 INFO L93 Difference]: Finished difference Result 805 states and 1068 transitions. [2022-04-28 10:12:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1068 transitions. [2022-04-28 10:12:30,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:30,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:30,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:30,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 526 states have (on average 1.3250950570342206) internal successors, (697), 526 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 701 transitions. [2022-04-28 10:12:30,023 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 701 transitions. Word has length 37 [2022-04-28 10:12:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:30,023 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 701 transitions. [2022-04-28 10:12:30,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:30,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 531 states and 701 transitions. [2022-04-28 10:12:33,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 701 transitions. [2022-04-28 10:12:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:33,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:33,281 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:33,297 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:12:33,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:33,481 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1504778038, now seen corresponding path program 25 times [2022-04-28 10:12:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:33,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855727621] [2022-04-28 10:12:33,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:33,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1504778038, now seen corresponding path program 26 times [2022-04-28 10:12:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133198462] [2022-04-28 10:12:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {76208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76188#true} is VALID [2022-04-28 10:12:33,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {76188#true} assume true; {76188#true} is VALID [2022-04-28 10:12:33,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76188#true} {76188#true} #94#return; {76188#true} is VALID [2022-04-28 10:12:33,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {76188#true} call ULTIMATE.init(); {76208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:33,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {76208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76188#true} is VALID [2022-04-28 10:12:33,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {76188#true} assume true; {76188#true} is VALID [2022-04-28 10:12:33,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76188#true} {76188#true} #94#return; {76188#true} is VALID [2022-04-28 10:12:33,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {76188#true} call #t~ret17 := main(); {76188#true} is VALID [2022-04-28 10:12:33,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {76188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76193#(= main_~y~0 0)} is VALID [2022-04-28 10:12:33,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {76193#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76194#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:33,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {76194#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76195#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:33,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {76195#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76196#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:33,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {76196#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76197#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:33,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {76197#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76198#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:33,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {76198#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:33,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {76199#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76200#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:33,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {76200#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {76200#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:33,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {76200#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {76201#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:33,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {76201#(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; {76202#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:33,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {76202#(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; {76203#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:33,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {76203#(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; {76204#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:33,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {76204#(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; {76205#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:33,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {76205#(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; {76206#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:33,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {76206#(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; {76207#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:33,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {76207#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {76189#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {76189#false} assume !(~y~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {76189#false} assume !(~x~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {76189#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {76189#false} assume !(~z~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {76189#false} assume !(~y~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L272 TraceCheckUtils]: 34: Hoare triple {76189#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {76189#false} ~cond := #in~cond; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {76189#false} assume 0 == ~cond; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {76189#false} assume !false; {76189#false} is VALID [2022-04-28 10:12:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:12:33,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133198462] [2022-04-28 10:12:33,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133198462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299704984] [2022-04-28 10:12:33,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:33,718 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:12:33,718 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:12:33,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:33,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:33,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:12:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:33,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:33,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {76188#true} call ULTIMATE.init(); {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {76188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {76188#true} assume true; {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76188#true} {76188#true} #94#return; {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {76188#true} call #t~ret17 := main(); {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {76188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76188#true} is VALID [2022-04-28 10:12:33,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {76188#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76188#true} is VALID [2022-04-28 10:12:33,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {76188#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:33,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {76233#(< 0 (mod (+ main_~x~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; {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:33,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:33,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {76241#(< 0 (mod (+ main_~x~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; {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:33,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {76245#(< 0 (mod (+ main_~x~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; {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:33,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:33,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:33,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:33,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:33,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {76249#(< 0 (mod (+ 5 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; {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:33,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:33,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:33,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:33,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {76189#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {76189#false} assume !(~z~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {76189#false} assume !(~y~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L272 TraceCheckUtils]: 34: Hoare triple {76189#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {76189#false} ~cond := #in~cond; {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {76189#false} assume 0 == ~cond; {76189#false} is VALID [2022-04-28 10:12:33,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {76189#false} assume !false; {76189#false} is VALID [2022-04-28 10:12:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:33,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:34,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {76189#false} assume !false; {76189#false} is VALID [2022-04-28 10:12:34,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {76189#false} assume 0 == ~cond; {76189#false} is VALID [2022-04-28 10:12:34,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {76189#false} ~cond := #in~cond; {76189#false} is VALID [2022-04-28 10:12:34,107 INFO L272 TraceCheckUtils]: 34: Hoare triple {76189#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {76189#false} is VALID [2022-04-28 10:12:34,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {76189#false} assume !(~y~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:34,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {76189#false} assume !(~z~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:34,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {76189#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {76189#false} is VALID [2022-04-28 10:12:34,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {76189#false} is VALID [2022-04-28 10:12:34,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {76278#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76278#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:12:34,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:34,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:34,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:34,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {76249#(< 0 (mod (+ 5 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; {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:34,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:34,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:34,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:34,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76253#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:12:34,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {76245#(< 0 (mod (+ main_~x~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; {76249#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:12:34,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {76241#(< 0 (mod (+ main_~x~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; {76245#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:12:34,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76241#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:12:34,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {76233#(< 0 (mod (+ main_~x~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; {76237#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:12:34,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {76188#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76233#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:12:34,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {76188#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {76188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {76188#true} call #t~ret17 := main(); {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76188#true} {76188#true} #94#return; {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {76188#true} assume true; {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {76188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {76188#true} call ULTIMATE.init(); {76188#true} is VALID [2022-04-28 10:12:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 10:12:34,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299704984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:34,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:34,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-28 10:12:34,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:34,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855727621] [2022-04-28 10:12:34,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855727621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:34,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:34,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:12:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328337427] [2022-04-28 10:12:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:12:34,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:34,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:34,141 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:12:34,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:12:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:12:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:12:34,142 INFO L87 Difference]: Start difference. First operand 531 states and 701 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:39,536 INFO L93 Difference]: Finished difference Result 697 states and 939 transitions. [2022-04-28 10:12:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:12:39,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:12:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 131 transitions. [2022-04-28 10:12:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 131 transitions. [2022-04-28 10:12:39,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 131 transitions. [2022-04-28 10:12:39,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:39,651 INFO L225 Difference]: With dead ends: 697 [2022-04-28 10:12:39,651 INFO L226 Difference]: Without dead ends: 575 [2022-04-28 10:12:39,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:12:39,653 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:39,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 96 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:12:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-04-28 10:12:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 532. [2022-04-28 10:12:42,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:42,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:42,795 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:42,796 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:42,806 INFO L93 Difference]: Finished difference Result 575 states and 764 transitions. [2022-04-28 10:12:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 764 transitions. [2022-04-28 10:12:42,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:42,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:42,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 575 states. [2022-04-28 10:12:42,807 INFO L87 Difference]: Start difference. First operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 575 states. [2022-04-28 10:12:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:42,817 INFO L93 Difference]: Finished difference Result 575 states and 764 transitions. [2022-04-28 10:12:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 764 transitions. [2022-04-28 10:12:42,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:42,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:42,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:42,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 527 states have (on average 1.3187855787476281) internal successors, (695), 527 states have internal predecessors, (695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 699 transitions. [2022-04-28 10:12:42,829 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 699 transitions. Word has length 38 [2022-04-28 10:12:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:42,829 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 699 transitions. [2022-04-28 10:12:42,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:12:42,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 532 states and 699 transitions. [2022-04-28 10:12:48,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 698 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 699 transitions. [2022-04-28 10:12:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:12:48,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:48,209 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:48,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:48,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:48,410 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1237131685, now seen corresponding path program 35 times [2022-04-28 10:12:48,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:48,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68339069] [2022-04-28 10:12:48,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:48,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1237131685, now seen corresponding path program 36 times [2022-04-28 10:12:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:48,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026583229] [2022-04-28 10:12:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {80136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {80111#true} assume true; {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80111#true} {80111#true} #94#return; {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {80111#true} call ULTIMATE.init(); {80136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:48,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {80136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {80111#true} assume true; {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80111#true} {80111#true} #94#return; {80111#true} is VALID [2022-04-28 10:12:48,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {80111#true} call #t~ret17 := main(); {80111#true} is VALID [2022-04-28 10:12:48,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {80111#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80116#(= main_~y~0 0)} is VALID [2022-04-28 10:12:48,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {80116#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80117#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:48,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {80117#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80118#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:48,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {80118#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80119#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:48,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {80119#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80120#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:48,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {80120#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80121#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:48,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {80121#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80122#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:48,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {80122#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80123#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:48,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {80123#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80124#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:48,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {80124#(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; {80125#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:48,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {80125#(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; {80126#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:48,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {80126#(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; {80127#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:48,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {80127#(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; {80128#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:48,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {80128#(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; {80129#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:48,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {80129#(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; {80130#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:48,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {80130#(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; {80131#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:48,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {80131#(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; {80132#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:48,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {80132#(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; {80133#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:48,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {80133#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80133#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:48,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {80133#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {80134#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {80134#(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; {80135#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {80135#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {80112#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {80112#false} assume !(~y~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {80112#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {80112#false} assume !(~x~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {80112#false} assume !(~z~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {80112#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {80112#false} assume !(~y~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L272 TraceCheckUtils]: 34: Hoare triple {80112#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {80112#false} ~cond := #in~cond; {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {80112#false} assume 0 == ~cond; {80112#false} is VALID [2022-04-28 10:12:48,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {80112#false} assume !false; {80112#false} is VALID [2022-04-28 10:12:48,808 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:12:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026583229] [2022-04-28 10:12:48,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026583229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161990310] [2022-04-28 10:12:48,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:48,809 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:12:48,810 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:12:48,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:12:48,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:48,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:12:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:48,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:48,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {80111#true} call ULTIMATE.init(); {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {80111#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {80111#true} assume true; {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80111#true} {80111#true} #94#return; {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {80111#true} call #t~ret17 := main(); {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {80111#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {80111#true} assume !(~x~0 % 4294967296 > 0); {80111#true} is VALID [2022-04-28 10:12:48,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {80111#true} ~z~0 := ~y~0; {80111#true} is VALID [2022-04-28 10:12:48,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {80111#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:12:48,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:12:48,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:48,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:48,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {80112#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {80112#false} assume !(~y~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L272 TraceCheckUtils]: 34: Hoare triple {80112#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {80112#false} ~cond := #in~cond; {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {80112#false} assume 0 == ~cond; {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {80112#false} assume !false; {80112#false} is VALID [2022-04-28 10:12:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-28 10:12:48,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:49,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {80112#false} assume !false; {80112#false} is VALID [2022-04-28 10:12:49,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {80112#false} assume 0 == ~cond; {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {80112#false} ~cond := #in~cond; {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L272 TraceCheckUtils]: 34: Hoare triple {80112#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {80112#false} assume !(~y~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {80112#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80112#false} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:49,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:49,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {80222#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:49,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80222#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:49,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:12:49,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {80111#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80215#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:12:49,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {80111#true} ~z~0 := ~y~0; {80111#true} is VALID [2022-04-28 10:12:49,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {80111#true} assume !(~x~0 % 4294967296 > 0); {80111#true} is VALID [2022-04-28 10:12:49,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {80111#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80111#true} is VALID [2022-04-28 10:12:49,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {80111#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {80111#true} call #t~ret17 := main(); {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80111#true} {80111#true} #94#return; {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {80111#true} assume true; {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {80111#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {80111#true} call ULTIMATE.init(); {80111#true} is VALID [2022-04-28 10:12:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-04-28 10:12:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161990310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:49,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 4, 4] total 25 [2022-04-28 10:12:49,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68339069] [2022-04-28 10:12:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68339069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:49,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:12:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870545852] [2022-04-28 10:12:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:49,044 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:12:49,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:49,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:49,066 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:49,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:12:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:49,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:12:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:12:49,067 INFO L87 Difference]: Start difference. First operand 532 states and 699 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:58,855 INFO L93 Difference]: Finished difference Result 889 states and 1343 transitions. [2022-04-28 10:12:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:12:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 10:12:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-28 10:12:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2022-04-28 10:12:58,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 257 transitions. [2022-04-28 10:12:59,045 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:12:59,078 INFO L225 Difference]: With dead ends: 889 [2022-04-28 10:12:59,078 INFO L226 Difference]: Without dead ends: 849 [2022-04-28 10:12:59,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1923, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:12:59,080 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:59,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 201 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 10:12:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-04-28 10:13:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 559. [2022-04-28 10:13:02,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:02,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 849 states. Second operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call 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:02,384 INFO L74 IsIncluded]: Start isIncluded. First operand 849 states. Second operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call 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:02,385 INFO L87 Difference]: Start difference. First operand 849 states. Second operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call 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:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:02,407 INFO L93 Difference]: Finished difference Result 849 states and 1126 transitions. [2022-04-28 10:13:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1126 transitions. [2022-04-28 10:13:02,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:02,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:02,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 849 states. [2022-04-28 10:13:02,408 INFO L87 Difference]: Start difference. First operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 849 states. [2022-04-28 10:13:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:02,430 INFO L93 Difference]: Finished difference Result 849 states and 1126 transitions. [2022-04-28 10:13:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1126 transitions. [2022-04-28 10:13:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:02,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:02,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:02,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 554 states have (on average 1.3231046931407942) internal successors, (733), 554 states have internal predecessors, (733), 3 states have call successors, (3), 3 states have call 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:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 737 transitions. [2022-04-28 10:13:02,443 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 737 transitions. Word has length 38 [2022-04-28 10:13:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:02,444 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 737 transitions. [2022-04-28 10:13:02,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:02,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 737 transitions. [2022-04-28 10:13:06,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 737 edges. 737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 737 transitions. [2022-04-28 10:13:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:06,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:06,492 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:06,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:06,707 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,SelfDestructingSolverStorable42 [2022-04-28 10:13:06,707 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -439094120, now seen corresponding path program 27 times [2022-04-28 10:13:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:06,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319885391] [2022-04-28 10:13:06,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:06,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash -439094120, now seen corresponding path program 28 times [2022-04-28 10:13:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:06,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342100267] [2022-04-28 10:13:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:07,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {85024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85002#true} is VALID [2022-04-28 10:13:07,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {85002#true} assume true; {85002#true} is VALID [2022-04-28 10:13:07,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85002#true} {85002#true} #94#return; {85002#true} is VALID [2022-04-28 10:13:07,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {85002#true} call ULTIMATE.init(); {85024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:07,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {85024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85002#true} is VALID [2022-04-28 10:13:07,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {85002#true} assume true; {85002#true} is VALID [2022-04-28 10:13:07,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85002#true} {85002#true} #94#return; {85002#true} is VALID [2022-04-28 10:13:07,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {85002#true} call #t~ret17 := main(); {85002#true} is VALID [2022-04-28 10:13:07,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {85002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85007#(= main_~y~0 0)} is VALID [2022-04-28 10:13:07,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {85007#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:07,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {85008#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:07,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {85009#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:07,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {85010#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:07,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {85011#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:07,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {85012#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:07,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {85013#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:07,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {85014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {85014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:07,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {85014#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:07,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {85015#(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; {85016#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:07,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {85016#(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; {85017#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:07,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {85017#(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; {85018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:07,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {85018#(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; {85019#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:07,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {85019#(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; {85020#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:07,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {85020#(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; {85021#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:07,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {85021#(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; {85022#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:13:07,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {85022#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85022#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:13:07,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {85022#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85021#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:13:07,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {85021#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85020#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:07,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {85020#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85019#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:07,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {85019#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:07,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {85018#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85017#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:07,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {85017#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85016#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:07,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {85016#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:07,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:07,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:07,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {85015#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85023#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:07,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {85023#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {85003#false} assume !(~y~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L272 TraceCheckUtils]: 35: Hoare triple {85003#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {85003#false} ~cond := #in~cond; {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {85003#false} assume 0 == ~cond; {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {85003#false} assume !false; {85003#false} is VALID [2022-04-28 10:13:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342100267] [2022-04-28 10:13:07,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342100267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795472178] [2022-04-28 10:13:07,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:07,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:07,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:07,019 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:13:07,021 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:13:07,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:07,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:07,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:13:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:07,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:07,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {85002#true} call ULTIMATE.init(); {85002#true} is VALID [2022-04-28 10:13:07,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {85002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85002#true} is VALID [2022-04-28 10:13:07,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {85002#true} assume true; {85002#true} is VALID [2022-04-28 10:13:07,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85002#true} {85002#true} #94#return; {85002#true} is VALID [2022-04-28 10:13:07,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {85002#true} call #t~ret17 := main(); {85002#true} is VALID [2022-04-28 10:13:07,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {85002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85002#true} is VALID [2022-04-28 10:13:07,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {85002#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:07,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {85046#(< 0 (mod (+ main_~x~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; {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:07,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:07,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {85054#(< 0 (mod (+ main_~x~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; {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:07,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {85058#(< 0 (mod (+ main_~x~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; {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:07,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {85070#(< 0 (mod (+ 7 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; {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:07,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {85062#(< 0 (mod (+ 5 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; {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:07,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:07,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:07,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:07,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {85003#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {85003#false} assume !(~z~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {85003#false} assume !(~y~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {85003#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {85003#false} ~cond := #in~cond; {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {85003#false} assume 0 == ~cond; {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {85003#false} assume !false; {85003#false} is VALID [2022-04-28 10:13:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:13:07,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {85003#false} assume !false; {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {85003#false} assume 0 == ~cond; {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {85003#false} ~cond := #in~cond; {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L272 TraceCheckUtils]: 35: Hoare triple {85003#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {85003#false} assume !(~y~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {85003#false} assume !(~z~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {85003#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {85003#false} is VALID [2022-04-28 10:13:07,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {85003#false} is VALID [2022-04-28 10:13:07,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {85098#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85098#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:13:07,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:07,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:07,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:07,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {85062#(< 0 (mod (+ 5 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; {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:07,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {85070#(< 0 (mod (+ 7 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; {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:07,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85070#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85066#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:13:07,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {85058#(< 0 (mod (+ main_~x~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; {85062#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:13:07,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {85054#(< 0 (mod (+ main_~x~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; {85058#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:13:07,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85054#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:13:07,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {85046#(< 0 (mod (+ main_~x~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; {85050#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:13:07,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {85002#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {85046#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:13:07,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {85002#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {85002#true} call #t~ret17 := main(); {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85002#true} {85002#true} #94#return; {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {85002#true} assume true; {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {85002#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {85002#true} call ULTIMATE.init(); {85002#true} is VALID [2022-04-28 10:13:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:13:07,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795472178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:07,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:07,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:13:07,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:07,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319885391] [2022-04-28 10:13:07,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319885391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:07,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:07,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:13:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545816775] [2022-04-28 10:13:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:07,501 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:13:07,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:07,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:13:07,526 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:13:07,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:13:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:13:07,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:13:07,527 INFO L87 Difference]: Start difference. First operand 559 states and 737 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:13:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:19,381 INFO L93 Difference]: Finished difference Result 856 states and 1254 transitions. [2022-04-28 10:13:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-28 10:13:19,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:13:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:13:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 321 transitions. [2022-04-28 10:13:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:13:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 321 transitions. [2022-04-28 10:13:19,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 321 transitions. [2022-04-28 10:13:19,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:19,680 INFO L225 Difference]: With dead ends: 856 [2022-04-28 10:13:19,680 INFO L226 Difference]: Without dead ends: 767 [2022-04-28 10:13:19,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3098 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=585, Invalid=10971, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 10:13:19,681 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 130 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:19,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 126 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 10:13:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-04-28 10:13:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 605. [2022-04-28 10:13:23,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:23,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 767 states. Second operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call 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,687 INFO L74 IsIncluded]: Start isIncluded. First operand 767 states. Second operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call 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,687 INFO L87 Difference]: Start difference. First operand 767 states. Second operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call 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,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,703 INFO L93 Difference]: Finished difference Result 767 states and 964 transitions. [2022-04-28 10:13:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 964 transitions. [2022-04-28 10:13:23,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 767 states. [2022-04-28 10:13:23,704 INFO L87 Difference]: Start difference. First operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 767 states. [2022-04-28 10:13:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:23,720 INFO L93 Difference]: Finished difference Result 767 states and 964 transitions. [2022-04-28 10:13:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 964 transitions. [2022-04-28 10:13:23,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:23,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:23,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:23,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 600 states have (on average 1.3283333333333334) internal successors, (797), 600 states have internal predecessors, (797), 3 states have call successors, (3), 3 states have call 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,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 801 transitions. [2022-04-28 10:13:23,735 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 801 transitions. Word has length 39 [2022-04-28 10:13:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:23,735 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 801 transitions. [2022-04-28 10:13:23,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 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:13:23,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 801 transitions. [2022-04-28 10:13:28,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 801 edges. 801 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 801 transitions. [2022-04-28 10:13:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:28,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:28,150 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:28,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:28,351 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,SelfDestructingSolverStorable43 [2022-04-28 10:13:28,351 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 37 times [2022-04-28 10:13:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:28,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128469211] [2022-04-28 10:13:28,362 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:28,362 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 932823321, now seen corresponding path program 38 times [2022-04-28 10:13:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:28,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749809984] [2022-04-28 10:13:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:28,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {89899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89882#true} is VALID [2022-04-28 10:13:28,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {89882#true} assume true; {89882#true} is VALID [2022-04-28 10:13:28,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89882#true} {89882#true} #94#return; {89882#true} is VALID [2022-04-28 10:13:28,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {89882#true} call ULTIMATE.init(); {89899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:28,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {89899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89882#true} is VALID [2022-04-28 10:13:28,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {89882#true} assume true; {89882#true} is VALID [2022-04-28 10:13:28,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89882#true} {89882#true} #94#return; {89882#true} is VALID [2022-04-28 10:13:28,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {89882#true} call #t~ret17 := main(); {89882#true} is VALID [2022-04-28 10:13:28,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {89882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89887#(= main_~y~0 0)} is VALID [2022-04-28 10:13:28,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {89887#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:28,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {89888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:28,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {89889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:28,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {89890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:28,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {89891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:28,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {89892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:28,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {89893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:28,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {89894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:28,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:28,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {89896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:28,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {89896#(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; {89897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:28,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {89897#(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; {89898#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:28,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {89898#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {89883#false} assume !(~x~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {89883#false} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L272 TraceCheckUtils]: 35: Hoare triple {89883#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {89883#false} ~cond := #in~cond; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {89883#false} assume 0 == ~cond; {89883#false} is VALID [2022-04-28 10:13:28,542 INFO L290 TraceCheckUtils]: 38: Hoare triple {89883#false} assume !false; {89883#false} is VALID [2022-04-28 10:13:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749809984] [2022-04-28 10:13:28,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749809984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60359263] [2022-04-28 10:13:28,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:28,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:28,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:28,544 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:13:28,545 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:13:28,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:28,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:28,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:13:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:28,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:28,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {89882#true} call ULTIMATE.init(); {89882#true} is VALID [2022-04-28 10:13:28,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {89882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89882#true} is VALID [2022-04-28 10:13:28,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {89882#true} assume true; {89882#true} is VALID [2022-04-28 10:13:28,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89882#true} {89882#true} #94#return; {89882#true} is VALID [2022-04-28 10:13:28,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {89882#true} call #t~ret17 := main(); {89882#true} is VALID [2022-04-28 10:13:28,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {89882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89887#(= main_~y~0 0)} is VALID [2022-04-28 10:13:28,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {89887#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:28,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {89888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:28,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {89889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:28,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {89890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:28,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {89891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:28,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {89892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:28,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {89893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:28,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {89894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:28,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:28,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {89895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {89896#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:28,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {89896#(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; {89897#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {89897#(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; {89954#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {89954#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {89883#false} assume !(~x~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {89883#false} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L272 TraceCheckUtils]: 35: Hoare triple {89883#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {89883#false} ~cond := #in~cond; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {89883#false} assume 0 == ~cond; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {89883#false} assume !false; {89883#false} is VALID [2022-04-28 10:13:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:28,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:29,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {89883#false} assume !false; {89883#false} is VALID [2022-04-28 10:13:29,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {89883#false} assume 0 == ~cond; {89883#false} is VALID [2022-04-28 10:13:29,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {89883#false} ~cond := #in~cond; {89883#false} is VALID [2022-04-28 10:13:29,117 INFO L272 TraceCheckUtils]: 35: Hoare triple {89883#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {89883#false} is VALID [2022-04-28 10:13:29,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {89883#false} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {89883#false} assume !(~x~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {89883#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {89883#false} assume !(~y~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {89883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89883#false} is VALID [2022-04-28 10:13:29,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {90078#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {89883#false} is VALID [2022-04-28 10:13:29,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {90082#(< 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; {90078#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:29,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {90086#(< 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; {90082#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:29,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {90090#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {90086#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:29,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {90090#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {90090#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:29,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {90097#(< 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; {90090#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:29,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {90101#(< 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; {90097#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:29,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {90105#(< 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; {90101#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:29,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {90109#(< 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; {90105#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:29,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {90113#(< 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; {90109#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:29,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {90117#(< 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; {90113#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:29,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {90121#(< 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; {90117#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:29,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {90125#(< 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; {90121#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:29,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {89882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90125#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:29,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {89882#true} call #t~ret17 := main(); {89882#true} is VALID [2022-04-28 10:13:29,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89882#true} {89882#true} #94#return; {89882#true} is VALID [2022-04-28 10:13:29,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {89882#true} assume true; {89882#true} is VALID [2022-04-28 10:13:29,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {89882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89882#true} is VALID [2022-04-28 10:13:29,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {89882#true} call ULTIMATE.init(); {89882#true} is VALID [2022-04-28 10:13:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:13:29,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60359263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:29,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:29,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:13:29,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:29,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128469211] [2022-04-28 10:13:29,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128469211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:29,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:29,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:13:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24397548] [2022-04-28 10:13:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:29,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:29,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:29,146 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:13:29,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:13:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:13:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:13:29,147 INFO L87 Difference]: Start difference. First operand 605 states and 801 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:35,194 INFO L93 Difference]: Finished difference Result 716 states and 938 transitions. [2022-04-28 10:13:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:13:35,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-28 10:13:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 126 transitions. [2022-04-28 10:13:35,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 126 transitions. [2022-04-28 10:13:35,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:35,308 INFO L225 Difference]: With dead ends: 716 [2022-04-28 10:13:35,308 INFO L226 Difference]: Without dead ends: 692 [2022-04-28 10:13:35,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 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:13:35,308 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 101 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:35,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 113 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:13:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-04-28 10:13:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 605. [2022-04-28 10:13:39,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:39,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 692 states. Second operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call 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:39,289 INFO L74 IsIncluded]: Start isIncluded. First operand 692 states. Second operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call 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:39,289 INFO L87 Difference]: Start difference. First operand 692 states. Second operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call 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:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:39,303 INFO L93 Difference]: Finished difference Result 692 states and 911 transitions. [2022-04-28 10:13:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 911 transitions. [2022-04-28 10:13:39,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:39,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:39,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 692 states. [2022-04-28 10:13:39,304 INFO L87 Difference]: Start difference. First operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 692 states. [2022-04-28 10:13:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:39,317 INFO L93 Difference]: Finished difference Result 692 states and 911 transitions. [2022-04-28 10:13:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 911 transitions. [2022-04-28 10:13:39,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:39,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:39,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:39,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 600 states have (on average 1.3266666666666667) internal successors, (796), 600 states have internal predecessors, (796), 3 states have call successors, (3), 3 states have call 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:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 800 transitions. [2022-04-28 10:13:39,336 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 800 transitions. Word has length 39 [2022-04-28 10:13:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:39,336 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 800 transitions. [2022-04-28 10:13:39,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:13:39,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 800 transitions. [2022-04-28 10:13:45,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 799 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 800 transitions. [2022-04-28 10:13:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:13:45,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:45,202 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:45,217 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:13:45,410 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,SelfDestructingSolverStorable44 [2022-04-28 10:13:45,411 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -463285912, now seen corresponding path program 39 times [2022-04-28 10:13:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:45,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730539538] [2022-04-28 10:13:45,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:45,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -463285912, now seen corresponding path program 40 times [2022-04-28 10:13:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:45,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230590417] [2022-04-28 10:13:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:45,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {94228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94202#true} is VALID [2022-04-28 10:13:45,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {94202#true} assume true; {94202#true} is VALID [2022-04-28 10:13:45,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94202#true} {94202#true} #94#return; {94202#true} is VALID [2022-04-28 10:13:45,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {94202#true} call ULTIMATE.init(); {94228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:45,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {94228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94202#true} is VALID [2022-04-28 10:13:45,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {94202#true} assume true; {94202#true} is VALID [2022-04-28 10:13:45,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94202#true} {94202#true} #94#return; {94202#true} is VALID [2022-04-28 10:13:45,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {94202#true} call #t~ret17 := main(); {94202#true} is VALID [2022-04-28 10:13:45,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {94202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94207#(= main_~y~0 0)} is VALID [2022-04-28 10:13:45,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {94207#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94208#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:45,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {94208#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94209#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:45,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {94209#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94210#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:45,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {94210#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94211#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:45,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {94211#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94212#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:45,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {94212#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94213#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:45,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {94213#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94214#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:45,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {94214#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94215#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:45,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {94215#(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; {94216#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:45,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {94216#(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; {94217#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:45,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {94217#(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; {94218#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:45,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {94218#(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; {94219#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:45,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {94219#(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; {94220#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:45,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {94220#(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; {94221#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:45,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {94221#(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; {94222#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:45,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {94222#(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; {94223#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:45,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {94223#(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; {94224#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:45,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {94224#(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; {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:45,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:45,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {94226#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {94226#(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; {94227#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {94227#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {94203#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {94203#false} assume !(~x~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {94203#false} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L272 TraceCheckUtils]: 35: Hoare triple {94203#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {94203#false} ~cond := #in~cond; {94203#false} is VALID [2022-04-28 10:13:45,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {94203#false} assume 0 == ~cond; {94203#false} is VALID [2022-04-28 10:13:45,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {94203#false} assume !false; {94203#false} is VALID [2022-04-28 10:13:45,772 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:13:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230590417] [2022-04-28 10:13:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230590417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262465598] [2022-04-28 10:13:45,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:45,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:45,775 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:13:45,778 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:13:45,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:45,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:45,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:13:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:45,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:46,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {94202#true} call ULTIMATE.init(); {94202#true} is VALID [2022-04-28 10:13:46,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {94202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94202#true} is VALID [2022-04-28 10:13:46,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {94202#true} assume true; {94202#true} is VALID [2022-04-28 10:13:46,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94202#true} {94202#true} #94#return; {94202#true} is VALID [2022-04-28 10:13:46,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {94202#true} call #t~ret17 := main(); {94202#true} is VALID [2022-04-28 10:13:46,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {94202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94207#(= main_~y~0 0)} is VALID [2022-04-28 10:13:46,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {94207#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94208#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:46,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {94208#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94209#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:46,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {94209#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94210#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:46,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {94210#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94211#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:46,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {94211#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94212#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:46,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {94212#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94213#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:46,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {94213#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94214#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:46,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {94214#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {94215#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:46,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {94215#(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; {94216#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:46,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {94216#(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; {94217#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:46,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {94217#(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; {94218#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:46,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {94218#(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; {94219#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:46,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {94219#(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; {94220#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:46,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {94220#(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; {94221#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:46,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {94221#(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; {94222#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:46,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {94222#(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; {94223#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:46,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {94223#(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; {94224#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:46,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {94224#(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; {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:46,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:46,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {94225#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {94226#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:13:46,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {94226#(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; {94310#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {94310#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {94203#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {94203#false} assume !(~x~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {94203#false} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L272 TraceCheckUtils]: 35: Hoare triple {94203#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {94203#false} ~cond := #in~cond; {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {94203#false} assume 0 == ~cond; {94203#false} is VALID [2022-04-28 10:13:46,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {94203#false} assume !false; {94203#false} is VALID [2022-04-28 10:13:46,194 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:13:46,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {94203#false} assume !false; {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {94203#false} assume 0 == ~cond; {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {94203#false} ~cond := #in~cond; {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L272 TraceCheckUtils]: 35: Hoare triple {94203#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {94203#false} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {94203#false} assume !(~x~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {94203#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {94203#false} assume !(~y~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {94203#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94203#false} is VALID [2022-04-28 10:13:46,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {94380#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94203#false} is VALID [2022-04-28 10:13:46,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {94384#(< 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; {94380#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:46,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {94388#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {94384#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:46,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {94388#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94388#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:46,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {94395#(< 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; {94388#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:46,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {94399#(< 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; {94395#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:46,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {94403#(< 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; {94399#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:46,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {94407#(< 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; {94403#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:46,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {94411#(< 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; {94407#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:46,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {94415#(< 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; {94411#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:46,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {94419#(< 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; {94415#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:46,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {94423#(< 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; {94419#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:46,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {94427#(< 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; {94423#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:46,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {94431#(< 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; {94427#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:46,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {94435#(< 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; {94431#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:46,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {94439#(< 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; {94435#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:46,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {94443#(< 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; {94439#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:46,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {94447#(< 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; {94443#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:46,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {94451#(< 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; {94447#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:46,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {94455#(< 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; {94451#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:46,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {94459#(< 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; {94455#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:46,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {94463#(< 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; {94459#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:46,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {94202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94463#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:46,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {94202#true} call #t~ret17 := main(); {94202#true} is VALID [2022-04-28 10:13:46,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94202#true} {94202#true} #94#return; {94202#true} is VALID [2022-04-28 10:13:46,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {94202#true} assume true; {94202#true} is VALID [2022-04-28 10:13:46,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {94202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {94202#true} is VALID [2022-04-28 10:13:46,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {94202#true} call ULTIMATE.init(); {94202#true} is VALID [2022-04-28 10:13:46,862 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:13:46,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262465598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:46,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:46,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:13:46,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730539538] [2022-04-28 10:13:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730539538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:46,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:46,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:13:46,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054888695] [2022-04-28 10:13:46,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:13:46,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:46,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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:13:46,887 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:13:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:13:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:13:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:13:46,888 INFO L87 Difference]: Start difference. First operand 605 states and 800 transitions. Second operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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:13:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:58,372 INFO L93 Difference]: Finished difference Result 980 states and 1478 transitions. [2022-04-28 10:13:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:13:58,372 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 10:13:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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:13:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 270 transitions. [2022-04-28 10:13:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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:13:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 270 transitions. [2022-04-28 10:13:58,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 270 transitions. [2022-04-28 10:13:58,576 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:13:58,615 INFO L225 Difference]: With dead ends: 980 [2022-04-28 10:13:58,615 INFO L226 Difference]: Without dead ends: 940 [2022-04-28 10:13:58,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 58 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:13:58,616 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 223 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4059 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:58,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 217 Invalid, 4213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4059 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 10:13:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-04-28 10:14:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 634. [2022-04-28 10:14:02,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:02,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 940 states. Second operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call 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:02,755 INFO L74 IsIncluded]: Start isIncluded. First operand 940 states. Second operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call 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:02,755 INFO L87 Difference]: Start difference. First operand 940 states. Second operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call 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:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:02,780 INFO L93 Difference]: Finished difference Result 940 states and 1252 transitions. [2022-04-28 10:14:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1252 transitions. [2022-04-28 10:14:02,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:02,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:02,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 940 states. [2022-04-28 10:14:02,782 INFO L87 Difference]: Start difference. First operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 940 states. [2022-04-28 10:14:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:02,812 INFO L93 Difference]: Finished difference Result 940 states and 1252 transitions. [2022-04-28 10:14:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1252 transitions. [2022-04-28 10:14:02,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:02,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:02,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:02,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 1.330683624801272) internal successors, (837), 629 states have internal predecessors, (837), 3 states have call successors, (3), 3 states have call 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:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 841 transitions. [2022-04-28 10:14:02,830 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 841 transitions. Word has length 39 [2022-04-28 10:14:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:02,830 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 841 transitions. [2022-04-28 10:14:02,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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:02,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 841 transitions. [2022-04-28 10:14:06,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 841 transitions. [2022-04-28 10:14:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:14:06,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:06,820 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:06,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:07,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:14:07,028 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 794869508, now seen corresponding path program 29 times [2022-04-28 10:14:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:07,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2075366790] [2022-04-28 10:14:07,030 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:07,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 794869508, now seen corresponding path program 30 times [2022-04-28 10:14:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:07,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746564853] [2022-04-28 10:14:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {99657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {99636#true} is VALID [2022-04-28 10:14:07,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {99636#true} assume true; {99636#true} is VALID [2022-04-28 10:14:07,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99636#true} {99636#true} #94#return; {99636#true} is VALID [2022-04-28 10:14:07,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {99636#true} call ULTIMATE.init(); {99657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:07,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {99657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {99636#true} is VALID [2022-04-28 10:14:07,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {99636#true} assume true; {99636#true} is VALID [2022-04-28 10:14:07,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99636#true} {99636#true} #94#return; {99636#true} is VALID [2022-04-28 10:14:07,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {99636#true} call #t~ret17 := main(); {99636#true} is VALID [2022-04-28 10:14:07,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {99636#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {99641#(= main_~y~0 0)} is VALID [2022-04-28 10:14:07,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {99641#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99642#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:07,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {99642#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99643#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:07,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {99643#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99644#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:07,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {99644#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99645#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:07,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {99645#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99646#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:07,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {99646#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99647#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:07,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {99647#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99648#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:07,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {99648#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {99650#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:07,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {99650#(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; {99651#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:07,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {99651#(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; {99652#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:07,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {99652#(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; {99653#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:07,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {99653#(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; {99654#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:07,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {99654#(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; {99655#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:07,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {99655#(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; {99656#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {99656#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {99637#false} assume !(~x~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {99637#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {99637#false} assume !(~z~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,315 INFO L272 TraceCheckUtils]: 36: Hoare triple {99637#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {99637#false} is VALID [2022-04-28 10:14:07,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {99637#false} ~cond := #in~cond; {99637#false} is VALID [2022-04-28 10:14:07,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {99637#false} assume 0 == ~cond; {99637#false} is VALID [2022-04-28 10:14:07,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {99637#false} assume !false; {99637#false} is VALID [2022-04-28 10:14:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:14:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746564853] [2022-04-28 10:14:07,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746564853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221404193] [2022-04-28 10:14:07,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:07,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:07,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:07,317 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:14:07,318 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:14:07,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:14:07,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:07,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:14:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:07,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:07,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {99636#true} call ULTIMATE.init(); {99636#true} is VALID [2022-04-28 10:14:07,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {99636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {99636#true} is VALID [2022-04-28 10:14:07,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {99636#true} assume true; {99636#true} is VALID [2022-04-28 10:14:07,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99636#true} {99636#true} #94#return; {99636#true} is VALID [2022-04-28 10:14:07,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {99636#true} call #t~ret17 := main(); {99636#true} is VALID [2022-04-28 10:14:07,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {99636#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {99641#(= main_~y~0 0)} is VALID [2022-04-28 10:14:07,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {99641#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99642#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:07,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {99642#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99643#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:07,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {99643#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99644#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:07,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {99644#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99645#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:07,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {99645#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99646#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:07,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {99646#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99647#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:07,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {99647#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99648#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:07,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {99648#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {99649#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {99706#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {99706#(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; {99710#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:14:07,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {99710#(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; {99714#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {99714#(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; {99718#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {99718#(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; {99722#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:14:07,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {99722#(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; {99726#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {99726#(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; {99730#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {99730#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {99637#false} assume !(~x~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {99637#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {99637#false} assume !(~z~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L272 TraceCheckUtils]: 36: Hoare triple {99637#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {99637#false} ~cond := #in~cond; {99637#false} is VALID [2022-04-28 10:14:07,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {99637#false} assume 0 == ~cond; {99637#false} is VALID [2022-04-28 10:14:07,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {99637#false} assume !false; {99637#false} is VALID [2022-04-28 10:14:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:14:07,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {99637#false} assume !false; {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {99637#false} assume 0 == ~cond; {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {99637#false} ~cond := #in~cond; {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L272 TraceCheckUtils]: 36: Hoare triple {99637#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {99637#false} assume !(~z~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {99637#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {99637#false} assume !(~x~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {99637#false} assume !(~y~0 % 4294967296 > 0); {99637#false} is VALID [2022-04-28 10:14:08,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {99637#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:08,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {99815#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99637#false} is VALID [2022-04-28 10:14:08,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {99819#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99815#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:08,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {99823#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99819#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:08,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {99827#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99823#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:08,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {99831#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99827#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:14:08,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {99835#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99831#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:08,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {99839#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {99835#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:08,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {99843#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {99839#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:08,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {99847#(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; {99843#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {99851#(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; {99847#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {99855#(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; {99851#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {99859#(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; {99855#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {99863#(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; {99859#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {99867#(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; {99863#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {99636#true} ~z~0 := ~y~0; {99867#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {99636#true} assume !(~x~0 % 4294967296 > 0); {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {99636#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {99636#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {99636#true} call #t~ret17 := main(); {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99636#true} {99636#true} #94#return; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {99636#true} assume true; {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {99636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {99636#true} is VALID [2022-04-28 10:14:08,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {99636#true} call ULTIMATE.init(); {99636#true} is VALID [2022-04-28 10:14:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:14:08,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221404193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:08,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 40 [2022-04-28 10:14:08,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2075366790] [2022-04-28 10:14:08,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2075366790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:08,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:14:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805170999] [2022-04-28 10:14:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:14:08,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:08,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:14:08,290 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:14:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:14:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:14:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:14:08,291 INFO L87 Difference]: Start difference. First operand 634 states and 841 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:14:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:15,672 INFO L93 Difference]: Finished difference Result 814 states and 1099 transitions. [2022-04-28 10:14:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 10:14:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:14:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:14:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-28 10:14:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:14:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 148 transitions. [2022-04-28 10:14:15,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 148 transitions. [2022-04-28 10:14:15,795 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:14:15,812 INFO L225 Difference]: With dead ends: 814 [2022-04-28 10:14:15,812 INFO L226 Difference]: Without dead ends: 682 [2022-04-28 10:14:15,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=608, Invalid=4794, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:14:15,813 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 99 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:15,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 131 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:14:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-28 10:14:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 635. [2022-04-28 10:14:19,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:19,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call 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:19,977 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call 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:19,978 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call 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:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:19,991 INFO L93 Difference]: Finished difference Result 682 states and 910 transitions. [2022-04-28 10:14:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 910 transitions. [2022-04-28 10:14:19,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:19,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:19,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 10:14:19,992 INFO L87 Difference]: Start difference. First operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 682 states. [2022-04-28 10:14:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:20,005 INFO L93 Difference]: Finished difference Result 682 states and 910 transitions. [2022-04-28 10:14:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 910 transitions. [2022-04-28 10:14:20,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:20,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:20,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:20,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 630 states have (on average 1.3253968253968254) internal successors, (835), 630 states have internal predecessors, (835), 3 states have call successors, (3), 3 states have call 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:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 839 transitions. [2022-04-28 10:14:20,021 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 839 transitions. Word has length 40 [2022-04-28 10:14:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:20,021 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 839 transitions. [2022-04-28 10:14:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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:14:20,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 635 states and 839 transitions. [2022-04-28 10:14:24,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 839 edges. 839 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 839 transitions. [2022-04-28 10:14:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:14:24,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:24,620 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:24,637 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:14:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:24,827 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1636623867, now seen corresponding path program 41 times [2022-04-28 10:14:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172207895] [2022-04-28 10:14:24,829 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:24,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1636623867, now seen corresponding path program 42 times [2022-04-28 10:14:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753589551] [2022-04-28 10:14:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {104275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104248#true} is VALID [2022-04-28 10:14:25,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {104248#true} assume true; {104248#true} is VALID [2022-04-28 10:14:25,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104248#true} {104248#true} #94#return; {104248#true} is VALID [2022-04-28 10:14:25,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {104248#true} call ULTIMATE.init(); {104275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:25,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {104275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104248#true} is VALID [2022-04-28 10:14:25,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {104248#true} assume true; {104248#true} is VALID [2022-04-28 10:14:25,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104248#true} {104248#true} #94#return; {104248#true} is VALID [2022-04-28 10:14:25,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {104248#true} call #t~ret17 := main(); {104248#true} is VALID [2022-04-28 10:14:25,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {104248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104253#(= main_~y~0 0)} is VALID [2022-04-28 10:14:25,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {104253#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104254#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:25,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {104254#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104255#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:25,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {104255#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104256#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:25,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {104256#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104257#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:25,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {104257#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104258#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:25,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {104258#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104259#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:25,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {104259#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104260#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:25,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {104260#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104261#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:25,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {104261#(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; {104262#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:25,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {104262#(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; {104263#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:25,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {104263#(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; {104264#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:25,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {104264#(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; {104265#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:25,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {104265#(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; {104266#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:25,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {104266#(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; {104267#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:25,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {104267#(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; {104268#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:25,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {104268#(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; {104269#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:25,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {104269#(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; {104270#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:25,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {104270#(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; {104271#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:25,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {104271#(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; {104272#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:25,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {104272#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {104272#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:25,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {104272#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {104273#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {104273#(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; {104274#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {104274#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {104249#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {104249#false} assume !(~y~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {104249#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {104249#false} assume !(~x~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {104249#false} assume !(~z~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {104249#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {104249#false} assume !(~y~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L272 TraceCheckUtils]: 36: Hoare triple {104249#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {104249#false} ~cond := #in~cond; {104249#false} is VALID [2022-04-28 10:14:25,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {104249#false} assume 0 == ~cond; {104249#false} is VALID [2022-04-28 10:14:25,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {104249#false} assume !false; {104249#false} is VALID [2022-04-28 10:14:25,196 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:14:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:25,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753589551] [2022-04-28 10:14:25,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753589551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:25,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732539281] [2022-04-28 10:14:25,196 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:25,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:25,197 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:14:25,198 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:14:25,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:14:25,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:25,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:14:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:25,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:25,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {104248#true} call ULTIMATE.init(); {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {104248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {104248#true} assume true; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104248#true} {104248#true} #94#return; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {104248#true} call #t~ret17 := main(); {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {104248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {104248#true} assume !(~x~0 % 4294967296 > 0); {104248#true} is VALID [2022-04-28 10:14:25,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {104248#true} ~z~0 := ~y~0; {104248#true} is VALID [2022-04-28 10:14:25,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {104248#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:25,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:25,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {104249#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {104249#false} assume !(~y~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L272 TraceCheckUtils]: 36: Hoare triple {104249#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {104249#false} ~cond := #in~cond; {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {104249#false} assume 0 == ~cond; {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {104249#false} assume !false; {104249#false} is VALID [2022-04-28 10:14:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-28 10:14:25,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:25,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {104249#false} assume !false; {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {104249#false} assume 0 == ~cond; {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {104249#false} ~cond := #in~cond; {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L272 TraceCheckUtils]: 36: Hoare triple {104249#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {104249#false} assume !(~y~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {104249#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104249#false} is VALID [2022-04-28 10:14:25,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {104367#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:25,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:25,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {104248#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104360#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {104248#true} ~z~0 := ~y~0; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {104248#true} assume !(~x~0 % 4294967296 > 0); {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {104248#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {104248#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {104248#true} call #t~ret17 := main(); {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104248#true} {104248#true} #94#return; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {104248#true} assume true; {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {104248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {104248#true} call ULTIMATE.init(); {104248#true} is VALID [2022-04-28 10:14:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-04-28 10:14:25,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732539281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:25,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:25,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 4] total 27 [2022-04-28 10:14:25,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:25,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172207895] [2022-04-28 10:14:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172207895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:25,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:14:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148260925] [2022-04-28 10:14:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:14:25,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:25,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:14:25,468 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:14:25,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:14:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:14:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:14:25,469 INFO L87 Difference]: Start difference. First operand 635 states and 839 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:14:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:37,798 INFO L93 Difference]: Finished difference Result 1026 states and 1548 transitions. [2022-04-28 10:14:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:14:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 10:14:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:14:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 283 transitions. [2022-04-28 10:14:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:14:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 283 transitions. [2022-04-28 10:14:37,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 283 transitions. [2022-04-28 10:14:38,007 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:14:38,044 INFO L225 Difference]: With dead ends: 1026 [2022-04-28 10:14:38,045 INFO L226 Difference]: Without dead ends: 986 [2022-04-28 10:14:38,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=2291, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:14:38,045 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 236 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4493 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 4657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:38,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 228 Invalid, 4657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4493 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 10:14:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-04-28 10:14:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 664. [2022-04-28 10:14:42,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:42,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call 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:42,341 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call 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:42,342 INFO L87 Difference]: Start difference. First operand 986 states. Second operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call 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:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:42,370 INFO L93 Difference]: Finished difference Result 986 states and 1313 transitions. [2022-04-28 10:14:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1313 transitions. [2022-04-28 10:14:42,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:42,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:42,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 986 states. [2022-04-28 10:14:42,372 INFO L87 Difference]: Start difference. First operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 986 states. [2022-04-28 10:14:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:42,399 INFO L93 Difference]: Finished difference Result 986 states and 1313 transitions. [2022-04-28 10:14:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1313 transitions. [2022-04-28 10:14:42,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:42,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:42,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:42,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 659 states have (on average 1.3292867981790593) internal successors, (876), 659 states have internal predecessors, (876), 3 states have call successors, (3), 3 states have call 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:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 880 transitions. [2022-04-28 10:14:42,418 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 880 transitions. Word has length 40 [2022-04-28 10:14:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:42,418 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 880 transitions. [2022-04-28 10:14:42,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 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:14:42,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 664 states and 880 transitions. [2022-04-28 10:14:46,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 880 transitions. [2022-04-28 10:14:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:14:46,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:46,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:46,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:46,855 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,SelfDestructingSolverStorable47 [2022-04-28 10:14:46,855 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 7 times [2022-04-28 10:14:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:46,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [350016560] [2022-04-28 10:14:46,858 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:46,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 8 times [2022-04-28 10:14:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:46,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389010211] [2022-04-28 10:14:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:46,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {109927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109915#true} is VALID [2022-04-28 10:14:46,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {109915#true} assume true; {109915#true} is VALID [2022-04-28 10:14:46,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109915#true} {109915#true} #94#return; {109915#true} is VALID [2022-04-28 10:14:46,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {109915#true} call ULTIMATE.init(); {109927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:46,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {109927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {109915#true} assume true; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109915#true} {109915#true} #94#return; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {109915#true} call #t~ret17 := main(); {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {109915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:46,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {109915#true} assume !(~x~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:46,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:46,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {109920#(<= 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; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:46,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {109921#(<= 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; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {109922#(<= 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; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {109923#(<= 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; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:46,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:46,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:46,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:46,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:46,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:47,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,001 INFO L272 TraceCheckUtils]: 37: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {109925#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:14:47,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {109925#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {109926#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:14:47,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {109926#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {109916#false} is VALID [2022-04-28 10:14:47,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {109916#false} assume !false; {109916#false} is VALID [2022-04-28 10:14:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 10:14:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389010211] [2022-04-28 10:14:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389010211] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100579105] [2022-04-28 10:14:47,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:47,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:47,003 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:14:47,008 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:14:47,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:47,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:47,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:14:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:47,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:47,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {109915#true} call ULTIMATE.init(); {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {109915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {109915#true} assume true; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109915#true} {109915#true} #94#return; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {109915#true} call #t~ret17 := main(); {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {109915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {109915#true} assume !(~x~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {109915#true} ~z~0 := ~y~0; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {109915#true} assume !(~z~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {109915#true} assume !(~y~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {109915#true} assume !(~x~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:47,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:47,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,320 INFO L272 TraceCheckUtils]: 37: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {110042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:47,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {110042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:47,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {110046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {109916#false} is VALID [2022-04-28 10:14:47,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {109916#false} assume !false; {109916#false} is VALID [2022-04-28 10:14:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:14:47,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:47,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {109916#false} assume !false; {109916#false} is VALID [2022-04-28 10:14:47,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {110046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {109916#false} is VALID [2022-04-28 10:14:47,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {110042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:47,445 INFO L272 TraceCheckUtils]: 37: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {110042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:47,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:47,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109924#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109923#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109922#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:14:47,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {109921#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {109915#true} assume !(~x~0 % 4294967296 > 0); {109920#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {109915#true} assume !(~y~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {109915#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {109915#true} assume !(~z~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {109915#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {109915#true} ~z~0 := ~y~0; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {109915#true} assume !(~x~0 % 4294967296 > 0); {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {109915#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {109915#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {109915#true} call #t~ret17 := main(); {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109915#true} {109915#true} #94#return; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {109915#true} assume true; {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {109915#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {109915#true} call ULTIMATE.init(); {109915#true} is VALID [2022-04-28 10:14:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:14:47,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100579105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:47,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:47,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-28 10:14:47,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [350016560] [2022-04-28 10:14:47,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [350016560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:47,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:47,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:14:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258124242] [2022-04-28 10:14:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:47,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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 41 [2022-04-28 10:14:47,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:47,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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:47,481 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:47,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:14:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:14:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:14:47,481 INFO L87 Difference]: Start difference. First operand 664 states and 880 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,727 INFO L93 Difference]: Finished difference Result 1209 states and 1562 transitions. [2022-04-28 10:14:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:14:57,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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 41 [2022-04-28 10:14:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-28 10:14:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 83 transitions. [2022-04-28 10:14:57,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 83 transitions. [2022-04-28 10:14:57,793 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:14:57,836 INFO L225 Difference]: With dead ends: 1209 [2022-04-28 10:14:57,836 INFO L226 Difference]: Without dead ends: 1018 [2022-04-28 10:14:57,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 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:14:57,836 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:57,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:14:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-04-28 10:15:02,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 641. [2022-04-28 10:15:02,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:02,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1018 states. Second operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:02,173 INFO L74 IsIncluded]: Start isIncluded. First operand 1018 states. Second operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:02,174 INFO L87 Difference]: Start difference. First operand 1018 states. Second operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:02,205 INFO L93 Difference]: Finished difference Result 1018 states and 1310 transitions. [2022-04-28 10:15:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1310 transitions. [2022-04-28 10:15:02,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:02,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1018 states. [2022-04-28 10:15:02,207 INFO L87 Difference]: Start difference. First operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1018 states. [2022-04-28 10:15:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:02,242 INFO L93 Difference]: Finished difference Result 1018 states and 1310 transitions. [2022-04-28 10:15:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1310 transitions. [2022-04-28 10:15:02,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:02,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:02,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:02,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 636 states have internal predecessors, (841), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:15:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 845 transitions. [2022-04-28 10:15:02,267 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 845 transitions. Word has length 41 [2022-04-28 10:15:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 845 transitions. [2022-04-28 10:15:02,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 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:15:02,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 641 states and 845 transitions. [2022-04-28 10:15:07,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 845 edges. 845 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 845 transitions. [2022-04-28 10:15:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:07,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:07,099 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:07,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:07,299 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,SelfDestructingSolverStorable48 [2022-04-28 10:15:07,299 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 31 times [2022-04-28 10:15:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:07,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007562473] [2022-04-28 10:15:07,301 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:07,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1107564487, now seen corresponding path program 32 times [2022-04-28 10:15:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:07,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462032599] [2022-04-28 10:15:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:07,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:07,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {115942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115925#true} is VALID [2022-04-28 10:15:07,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {115925#true} assume true; {115925#true} is VALID [2022-04-28 10:15:07,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115925#true} {115925#true} #94#return; {115925#true} is VALID [2022-04-28 10:15:07,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {115925#true} call ULTIMATE.init(); {115942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:07,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {115942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115925#true} is VALID [2022-04-28 10:15:07,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {115925#true} assume true; {115925#true} is VALID [2022-04-28 10:15:07,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115925#true} {115925#true} #94#return; {115925#true} is VALID [2022-04-28 10:15:07,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {115925#true} call #t~ret17 := main(); {115925#true} is VALID [2022-04-28 10:15:07,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {115925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115925#true} is VALID [2022-04-28 10:15:07,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {115925#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115931#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:15:07,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {115931#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115932#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {115932#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115933#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {115933#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115934#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {115934#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:15:07,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:15:07,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:15:07,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {115935#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115936#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-28 10:15:07,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {115936#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115937#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-28 10:15:07,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {115937#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115938#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-28 10:15:07,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {115938#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115939#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-28 10:15:07,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {115939#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115940#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:15:07,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {115940#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {115941#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {115926#false} assume !(~z~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {115926#false} assume !(~y~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L272 TraceCheckUtils]: 37: Hoare triple {115926#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {115926#false} ~cond := #in~cond; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {115926#false} assume 0 == ~cond; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {115926#false} assume !false; {115926#false} is VALID [2022-04-28 10:15:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:07,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462032599] [2022-04-28 10:15:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462032599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:07,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049181295] [2022-04-28 10:15:07,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:07,497 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:15:07,498 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:15:07,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:07,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:07,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:15:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:07,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:07,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {115925#true} call ULTIMATE.init(); {115925#true} is VALID [2022-04-28 10:15:07,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {115925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115925#true} is VALID [2022-04-28 10:15:07,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {115925#true} assume true; {115925#true} is VALID [2022-04-28 10:15:07,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115925#true} {115925#true} #94#return; {115925#true} is VALID [2022-04-28 10:15:07,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {115925#true} call #t~ret17 := main(); {115925#true} is VALID [2022-04-28 10:15:07,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {115925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115925#true} is VALID [2022-04-28 10:15:07,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {115925#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:07,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:07,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:07,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:07,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {115926#false} assume !(~z~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {115926#false} assume !(~y~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L272 TraceCheckUtils]: 37: Hoare triple {115926#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {115926#false} ~cond := #in~cond; {115926#false} is VALID [2022-04-28 10:15:07,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {115926#false} assume 0 == ~cond; {115926#false} is VALID [2022-04-28 10:15:07,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {115926#false} assume !false; {115926#false} is VALID [2022-04-28 10:15:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:07,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:07,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {115926#false} assume !false; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {115926#false} assume 0 == ~cond; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {115926#false} ~cond := #in~cond; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L272 TraceCheckUtils]: 37: Hoare triple {115926#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {115926#false} assume !(~y~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {115926#false} assume !(~z~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {115926#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {115926#false} is VALID [2022-04-28 10:15:07,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {115926#false} is VALID [2022-04-28 10:15:07,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {116008#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:07,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:07,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115983#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:15:07,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115979#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115975#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:15:07,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115971#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:15:07,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115967#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:15:07,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {115925#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115930#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:15:07,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {115925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115925#true} is VALID [2022-04-28 10:15:07,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {115925#true} call #t~ret17 := main(); {115925#true} is VALID [2022-04-28 10:15:07,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115925#true} {115925#true} #94#return; {115925#true} is VALID [2022-04-28 10:15:07,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {115925#true} assume true; {115925#true} is VALID [2022-04-28 10:15:07,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {115925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115925#true} is VALID [2022-04-28 10:15:07,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {115925#true} call ULTIMATE.init(); {115925#true} is VALID [2022-04-28 10:15:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 10:15:07,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049181295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:07,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-28 10:15:07,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:07,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007562473] [2022-04-28 10:15:07,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007562473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:07,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:07,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:15:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187213966] [2022-04-28 10:15:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:07,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:07,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:07,935 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:15:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:15:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:15:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:15:07,936 INFO L87 Difference]: Start difference. First operand 641 states and 845 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:20,721 INFO L93 Difference]: Finished difference Result 1261 states and 1656 transitions. [2022-04-28 10:15:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:15:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2022-04-28 10:15:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2022-04-28 10:15:20,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 122 transitions. [2022-04-28 10:15:20,831 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:15:20,886 INFO L225 Difference]: With dead ends: 1261 [2022-04-28 10:15:20,886 INFO L226 Difference]: Without dead ends: 1175 [2022-04-28 10:15:20,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:15:20,887 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 108 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:20,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 72 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:15:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-04-28 10:15:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 682. [2022-04-28 10:15:25,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:25,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1175 states. Second operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call 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:25,763 INFO L74 IsIncluded]: Start isIncluded. First operand 1175 states. Second operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call 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:25,764 INFO L87 Difference]: Start difference. First operand 1175 states. Second operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call 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:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:25,800 INFO L93 Difference]: Finished difference Result 1175 states and 1526 transitions. [2022-04-28 10:15:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1526 transitions. [2022-04-28 10:15:25,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:25,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:25,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1175 states. [2022-04-28 10:15:25,802 INFO L87 Difference]: Start difference. First operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1175 states. [2022-04-28 10:15:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:25,837 INFO L93 Difference]: Finished difference Result 1175 states and 1526 transitions. [2022-04-28 10:15:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1526 transitions. [2022-04-28 10:15:25,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:25,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:25,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:25,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 677 states have (on average 1.31314623338257) internal successors, (889), 677 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call 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:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 893 transitions. [2022-04-28 10:15:25,856 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 893 transitions. Word has length 41 [2022-04-28 10:15:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:25,856 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 893 transitions. [2022-04-28 10:15:25,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 14 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:15:25,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 682 states and 893 transitions. [2022-04-28 10:15:33,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 893 edges. 892 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 893 transitions. [2022-04-28 10:15:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:33,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:33,455 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:33,473 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:15:33,655 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,SelfDestructingSolverStorable49 [2022-04-28 10:15:33,655 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:33,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash -176025528, now seen corresponding path program 33 times [2022-04-28 10:15:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236988174] [2022-04-28 10:15:33,658 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:33,658 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -176025528, now seen corresponding path program 34 times [2022-04-28 10:15:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:33,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315069216] [2022-04-28 10:15:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:33,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {122476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {122454#true} assume true; {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122454#true} {122454#true} #94#return; {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {122454#true} call ULTIMATE.init(); {122476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:33,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {122476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {122454#true} assume true; {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122454#true} {122454#true} #94#return; {122454#true} is VALID [2022-04-28 10:15:33,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {122454#true} call #t~ret17 := main(); {122454#true} is VALID [2022-04-28 10:15:33,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {122454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122459#(= main_~y~0 0)} is VALID [2022-04-28 10:15:33,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {122459#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:33,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {122460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:33,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {122461#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:33,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {122462#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:33,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {122463#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:33,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {122464#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:33,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {122465#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122466#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:33,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {122466#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122467#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:33,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {122467#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {122467#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:33,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {122467#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {122468#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:33,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {122468#(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; {122469#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:33,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {122469#(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; {122470#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:15:33,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {122470#(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; {122471#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:15:33,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {122471#(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; {122472#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:15:33,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {122472#(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; {122473#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:15:33,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {122473#(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; {122474#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:15:33,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {122474#(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; {122475#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {122475#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {122455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {122455#false} assume !(~y~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {122455#false} assume !(~x~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {122455#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {122455#false} assume !(~z~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:33,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {122455#false} assume !(~y~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:33,952 INFO L272 TraceCheckUtils]: 37: Hoare triple {122455#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {122455#false} is VALID [2022-04-28 10:15:33,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {122455#false} ~cond := #in~cond; {122455#false} is VALID [2022-04-28 10:15:33,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {122455#false} assume 0 == ~cond; {122455#false} is VALID [2022-04-28 10:15:33,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {122455#false} assume !false; {122455#false} is VALID [2022-04-28 10:15:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:15:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:33,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315069216] [2022-04-28 10:15:33,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315069216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:33,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601675006] [2022-04-28 10:15:33,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:33,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:33,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:33,953 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:15:33,954 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:15:34,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:34,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:34,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:15:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:34,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:34,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {122454#true} call ULTIMATE.init(); {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {122454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {122454#true} assume true; {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122454#true} {122454#true} #94#return; {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {122454#true} call #t~ret17 := main(); {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {122454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {122454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122454#true} is VALID [2022-04-28 10:15:34,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {122454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:34,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {122501#(< 0 (mod (+ main_~x~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; {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:34,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:34,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {122509#(< 0 (mod (+ main_~x~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; {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:34,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {122513#(< 0 (mod (+ main_~x~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; {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:34,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {122525#(< 0 (mod (+ 7 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; {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:34,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {122517#(< 0 (mod (+ 5 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; {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:34,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:34,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:34,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:34,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {122455#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {122455#false} assume !(~z~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {122455#false} assume !(~y~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L272 TraceCheckUtils]: 37: Hoare triple {122455#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {122455#false} ~cond := #in~cond; {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {122455#false} assume 0 == ~cond; {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {122455#false} assume !false; {122455#false} is VALID [2022-04-28 10:15:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:15:34,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {122455#false} assume !false; {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {122455#false} assume 0 == ~cond; {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {122455#false} ~cond := #in~cond; {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L272 TraceCheckUtils]: 37: Hoare triple {122455#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {122455#false} assume !(~y~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {122455#false} assume !(~z~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {122455#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {122455#false} is VALID [2022-04-28 10:15:34,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {122455#false} is VALID [2022-04-28 10:15:34,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {122553#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122553#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:15:34,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:34,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:34,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:34,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {122517#(< 0 (mod (+ 5 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; {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:34,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {122525#(< 0 (mod (+ 7 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; {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:34,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122525#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122521#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:15:34,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {122513#(< 0 (mod (+ main_~x~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; {122517#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:15:34,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {122509#(< 0 (mod (+ main_~x~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; {122513#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:15:34,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122509#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:15:34,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {122501#(< 0 (mod (+ main_~x~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; {122505#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:15:34,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {122454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122501#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:15:34,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {122454#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {122454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {122454#true} call #t~ret17 := main(); {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122454#true} {122454#true} #94#return; {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {122454#true} assume true; {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {122454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {122454#true} call ULTIMATE.init(); {122454#true} is VALID [2022-04-28 10:15:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 10:15:34,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601675006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:34,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 28 [2022-04-28 10:15:34,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:34,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236988174] [2022-04-28 10:15:34,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236988174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:34,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:15:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78285073] [2022-04-28 10:15:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:34,448 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 41 [2022-04-28 10:15:34,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:34,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:34,469 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:15:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:15:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:15:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:15:34,470 INFO L87 Difference]: Start difference. First operand 682 states and 893 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:42,730 INFO L93 Difference]: Finished difference Result 837 states and 1138 transitions. [2022-04-28 10:15:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 10:15:42,730 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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 41 [2022-04-28 10:15:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2022-04-28 10:15:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2022-04-28 10:15:42,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 139 transitions. [2022-04-28 10:15:42,830 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:15:42,850 INFO L225 Difference]: With dead ends: 837 [2022-04-28 10:15:42,850 INFO L226 Difference]: Without dead ends: 735 [2022-04-28 10:15:42,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=3610, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:15:42,851 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:42,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 131 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:15:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-04-28 10:15:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 683. [2022-04-28 10:15:47,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:47,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 735 states. Second operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call 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:47,712 INFO L74 IsIncluded]: Start isIncluded. First operand 735 states. Second operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call 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:47,713 INFO L87 Difference]: Start difference. First operand 735 states. Second operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call 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:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:47,727 INFO L93 Difference]: Finished difference Result 735 states and 974 transitions. [2022-04-28 10:15:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 974 transitions. [2022-04-28 10:15:47,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:47,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 735 states. [2022-04-28 10:15:47,728 INFO L87 Difference]: Start difference. First operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 735 states. [2022-04-28 10:15:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:47,742 INFO L93 Difference]: Finished difference Result 735 states and 974 transitions. [2022-04-28 10:15:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 974 transitions. [2022-04-28 10:15:47,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:47,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:47,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:47,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 678 states have (on average 1.3126843657817109) internal successors, (890), 678 states have internal predecessors, (890), 3 states have call successors, (3), 3 states have call 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:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 894 transitions. [2022-04-28 10:15:47,764 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 894 transitions. Word has length 41 [2022-04-28 10:15:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:47,764 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 894 transitions. [2022-04-28 10:15:47,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 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:15:47,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 894 transitions. [2022-04-28 10:15:53,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 894 edges. 894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 894 transitions. [2022-04-28 10:15:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:15:53,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:53,985 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:54,001 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:15:54,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:54,185 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash 30999719, now seen corresponding path program 43 times [2022-04-28 10:15:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:54,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652740173] [2022-04-28 10:15:54,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:54,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 30999719, now seen corresponding path program 44 times [2022-04-28 10:15:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:54,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110862461] [2022-04-28 10:15:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:54,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:54,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {127328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {127310#true} is VALID [2022-04-28 10:15:54,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {127310#true} assume true; {127310#true} is VALID [2022-04-28 10:15:54,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127310#true} {127310#true} #94#return; {127310#true} is VALID [2022-04-28 10:15:54,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {127310#true} call ULTIMATE.init(); {127328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:54,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {127328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {127310#true} is VALID [2022-04-28 10:15:54,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {127310#true} assume true; {127310#true} is VALID [2022-04-28 10:15:54,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127310#true} {127310#true} #94#return; {127310#true} is VALID [2022-04-28 10:15:54,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {127310#true} call #t~ret17 := main(); {127310#true} is VALID [2022-04-28 10:15:54,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {127310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127315#(= main_~y~0 0)} is VALID [2022-04-28 10:15:54,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {127315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:54,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {127316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:54,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {127317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:54,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {127318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:54,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {127319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:54,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {127320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:54,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {127321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:54,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {127322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:54,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {127323#(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; {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:54,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:54,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {127325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:54,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {127325#(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; {127326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:54,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {127326#(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; {127327#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {127327#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {127311#false} assume !(~y~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {127311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {127311#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {127311#false} assume !(~x~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {127311#false} assume !(~z~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {127311#false} assume !(~y~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,391 INFO L272 TraceCheckUtils]: 37: Hoare triple {127311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {127311#false} is VALID [2022-04-28 10:15:54,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {127311#false} ~cond := #in~cond; {127311#false} is VALID [2022-04-28 10:15:54,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {127311#false} assume 0 == ~cond; {127311#false} is VALID [2022-04-28 10:15:54,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {127311#false} assume !false; {127311#false} is VALID [2022-04-28 10:15:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-28 10:15:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110862461] [2022-04-28 10:15:54,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110862461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926299182] [2022-04-28 10:15:54,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:54,393 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:15:54,393 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:15:54,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:54,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:54,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:15:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:54,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:54,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {127310#true} call ULTIMATE.init(); {127310#true} is VALID [2022-04-28 10:15:54,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {127310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {127310#true} is VALID [2022-04-28 10:15:54,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {127310#true} assume true; {127310#true} is VALID [2022-04-28 10:15:54,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127310#true} {127310#true} #94#return; {127310#true} is VALID [2022-04-28 10:15:54,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {127310#true} call #t~ret17 := main(); {127310#true} is VALID [2022-04-28 10:15:54,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {127310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127315#(= main_~y~0 0)} is VALID [2022-04-28 10:15:54,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {127315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:54,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {127316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:54,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {127317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:54,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {127318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:54,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {127319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:54,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {127320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:54,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {127321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:54,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {127322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {127323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:54,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {127323#(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; {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:54,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:54,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {127324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {127325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:54,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {127325#(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; {127326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:54,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {127326#(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; {127386#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:54,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {127386#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {127386#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:54,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {127386#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:54,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {127326#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:54,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {127325#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:54,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {127399#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127403#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:54,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {127403#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127407#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:54,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {127407#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127411#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:54,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {127411#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127415#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:54,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {127415#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127419#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:15:54,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {127419#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:15:54,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~y~0 % 4294967296 > 0); {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:15:54,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:15:54,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:15:54,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~x~0 % 4294967296 > 0); {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:15:54,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {127423#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:54,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {127311#false} assume !(~y~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L272 TraceCheckUtils]: 37: Hoare triple {127311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {127311#false} ~cond := #in~cond; {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {127311#false} assume 0 == ~cond; {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {127311#false} assume !false; {127311#false} is VALID [2022-04-28 10:15:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:15:54,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {127311#false} assume !false; {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {127311#false} assume 0 == ~cond; {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {127311#false} ~cond := #in~cond; {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L272 TraceCheckUtils]: 37: Hoare triple {127311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {127311#false} assume !(~y~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:55,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {127311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {127311#false} is VALID [2022-04-28 10:15:55,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {127481#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {127311#false} is VALID [2022-04-28 10:15:55,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {127481#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {127481#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:55,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {127481#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127481#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:55,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {127481#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {127481#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:55,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {127481#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {127481#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:55,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {127497#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127481#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:55,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {127501#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127497#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:15:55,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {127505#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127501#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:15:55,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {127509#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127505#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:15:55,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {127513#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127509#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:15:55,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {127517#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127513#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:55,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {127521#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127517#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:15:55,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {127525#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127521#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:55,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {127529#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {127525#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:15:55,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {127529#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !(~z~0 % 4294967296 > 0); {127529#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:15:55,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {127525#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {127529#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:15:55,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {127521#(< 0 (mod (+ 7 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; {127525#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:15:55,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {127542#(< 0 (mod (+ 7 main_~y~0) 4294967296))} ~z~0 := ~y~0; {127521#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:55,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {127542#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {127542#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:55,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {127549#(< 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; {127542#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:55,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {127553#(< 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; {127549#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:55,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {127557#(< 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; {127553#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:55,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {127561#(< 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; {127557#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:55,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {127565#(< 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; {127561#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:55,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {127569#(< 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; {127565#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:55,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {127573#(< 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; {127569#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:55,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {127577#(< 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; {127573#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:55,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {127581#(< 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; {127577#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:55,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {127310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {127581#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:55,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {127310#true} call #t~ret17 := main(); {127310#true} is VALID [2022-04-28 10:15:55,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127310#true} {127310#true} #94#return; {127310#true} is VALID [2022-04-28 10:15:55,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {127310#true} assume true; {127310#true} is VALID [2022-04-28 10:15:55,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {127310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {127310#true} is VALID [2022-04-28 10:15:55,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {127310#true} call ULTIMATE.init(); {127310#true} is VALID [2022-04-28 10:15:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:15:55,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926299182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:55,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:55,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 44 [2022-04-28 10:15:55,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:55,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652740173] [2022-04-28 10:15:55,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652740173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:55,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:15:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364967304] [2022-04-28 10:15:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:15:55,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:55,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:15:55,479 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:15:55,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:15:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:15:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1596, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:15:55,479 INFO L87 Difference]: Start difference. First operand 683 states and 894 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:16:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:03,039 INFO L93 Difference]: Finished difference Result 824 states and 1067 transitions. [2022-04-28 10:16:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:16:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:16:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:16:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 133 transitions. [2022-04-28 10:16:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:16:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 133 transitions. [2022-04-28 10:16:03,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 133 transitions. [2022-04-28 10:16:03,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:03,163 INFO L225 Difference]: With dead ends: 824 [2022-04-28 10:16:03,163 INFO L226 Difference]: Without dead ends: 799 [2022-04-28 10:16:03,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=2969, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:16:03,165 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 100 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:03,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 123 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:16:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-04-28 10:16:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 683. [2022-04-28 10:16:08,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:08,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:08,053 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:08,053 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:08,073 INFO L93 Difference]: Finished difference Result 799 states and 1039 transitions. [2022-04-28 10:16:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1039 transitions. [2022-04-28 10:16:08,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:08,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:08,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 799 states. [2022-04-28 10:16:08,075 INFO L87 Difference]: Start difference. First operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 799 states. [2022-04-28 10:16:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:08,094 INFO L93 Difference]: Finished difference Result 799 states and 1039 transitions. [2022-04-28 10:16:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1039 transitions. [2022-04-28 10:16:08,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:08,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:08,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:08,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 678 states have (on average 1.3112094395280236) internal successors, (889), 678 states have internal predecessors, (889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 893 transitions. [2022-04-28 10:16:08,113 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 893 transitions. Word has length 41 [2022-04-28 10:16:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:08,113 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 893 transitions. [2022-04-28 10:16:08,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:16:08,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 893 transitions. [2022-04-28 10:16:14,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 893 edges. 893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 893 transitions. [2022-04-28 10:16:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:16:14,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:14,588 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:14,604 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:16:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:14,788 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 644605192, now seen corresponding path program 45 times [2022-04-28 10:16:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:14,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252144042] [2022-04-28 10:16:14,791 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:14,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 644605192, now seen corresponding path program 46 times [2022-04-28 10:16:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488183117] [2022-04-28 10:16:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:15,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:15,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {132274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132246#true} is VALID [2022-04-28 10:16:15,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {132246#true} assume true; {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132246#true} {132246#true} #94#return; {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {132246#true} call ULTIMATE.init(); {132274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:15,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {132274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {132246#true} assume true; {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132246#true} {132246#true} #94#return; {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {132246#true} call #t~ret17 := main(); {132246#true} is VALID [2022-04-28 10:16:15,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {132246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132251#(= main_~y~0 0)} is VALID [2022-04-28 10:16:15,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {132251#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:15,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {132252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:15,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {132253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:15,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {132254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:15,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {132255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:15,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {132256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:15,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {132257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:15,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {132258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:15,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {132259#(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; {132260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:15,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {132260#(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; {132261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:15,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {132261#(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; {132262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:15,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {132262#(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; {132263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:15,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {132263#(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; {132264#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:15,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {132264#(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; {132265#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:15,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {132265#(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; {132266#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:15,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {132266#(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; {132267#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:15,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {132267#(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; {132268#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:15,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {132268#(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; {132269#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:15,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {132269#(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; {132270#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:15,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {132270#(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; {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:15,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:15,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {132272#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:15,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {132272#(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; {132273#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {132273#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {132247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {132247#false} assume !(~x~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {132247#false} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L272 TraceCheckUtils]: 37: Hoare triple {132247#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {132247#false} ~cond := #in~cond; {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {132247#false} assume 0 == ~cond; {132247#false} is VALID [2022-04-28 10:16:15,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {132247#false} assume !false; {132247#false} is VALID [2022-04-28 10:16:15,218 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:16:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488183117] [2022-04-28 10:16:15,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488183117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703678834] [2022-04-28 10:16:15,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:15,220 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:16:15,220 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:16:15,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:15,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:15,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:16:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:15,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:15,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {132246#true} call ULTIMATE.init(); {132246#true} is VALID [2022-04-28 10:16:15,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {132246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132246#true} is VALID [2022-04-28 10:16:15,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {132246#true} assume true; {132246#true} is VALID [2022-04-28 10:16:15,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132246#true} {132246#true} #94#return; {132246#true} is VALID [2022-04-28 10:16:15,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {132246#true} call #t~ret17 := main(); {132246#true} is VALID [2022-04-28 10:16:15,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {132246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132251#(= main_~y~0 0)} is VALID [2022-04-28 10:16:15,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {132251#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:15,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {132252#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:15,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {132253#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:15,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {132254#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:15,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {132255#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:15,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {132256#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:15,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {132257#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:15,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {132258#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132259#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:15,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {132259#(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; {132260#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:15,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {132260#(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; {132261#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:15,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {132261#(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; {132262#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:15,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {132262#(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; {132263#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:15,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {132263#(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; {132264#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:16:15,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {132264#(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; {132265#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:16:15,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {132265#(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; {132266#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:16:15,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {132266#(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; {132267#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:16:15,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {132267#(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; {132268#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:16:15,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {132268#(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; {132269#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:16:15,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {132269#(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; {132270#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:16:15,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {132270#(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; {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:15,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:16:15,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {132271#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {132272#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:16:15,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {132272#(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; {132362#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {132362#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {132247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {132247#false} assume !(~x~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {132247#false} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L272 TraceCheckUtils]: 37: Hoare triple {132247#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {132247#false} ~cond := #in~cond; {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {132247#false} assume 0 == ~cond; {132247#false} is VALID [2022-04-28 10:16:15,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {132247#false} assume !false; {132247#false} is VALID [2022-04-28 10:16:15,599 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:16:15,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:16,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {132247#false} assume !false; {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {132247#false} assume 0 == ~cond; {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {132247#false} ~cond := #in~cond; {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {132247#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {132247#false} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {132247#false} assume !(~x~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {132247#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {132247#false} assume !(~y~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:16,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {132247#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132247#false} is VALID [2022-04-28 10:16:16,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {132432#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {132247#false} is VALID [2022-04-28 10:16:16,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {132436#(< 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; {132432#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:16,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {132440#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {132436#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:16,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {132440#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {132440#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:16,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {132447#(< 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; {132440#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:16,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {132451#(< 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; {132447#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:16,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {132455#(< 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; {132451#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:16,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {132459#(< 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; {132455#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:16,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {132463#(< 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; {132459#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:16,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {132467#(< 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; {132463#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:16,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {132471#(< 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; {132467#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {132475#(< 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; {132471#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:16,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {132479#(< 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; {132475#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {132483#(< 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; {132479#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:16:16,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {132487#(< 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; {132483#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:16:16,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {132491#(< 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; {132487#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:16:16,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {132495#(< 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; {132491#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:16:16,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {132499#(< 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; {132495#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:16:16,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {132503#(< 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; {132499#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:16:16,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {132507#(< 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; {132503#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:16:16,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {132511#(< 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; {132507#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:16:16,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {132515#(< 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; {132511#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:16:16,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {132519#(< 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; {132515#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:16:16,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {132523#(< 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; {132519#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:16:16,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {132246#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132523#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:16,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {132246#true} call #t~ret17 := main(); {132246#true} is VALID [2022-04-28 10:16:16,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132246#true} {132246#true} #94#return; {132246#true} is VALID [2022-04-28 10:16:16,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {132246#true} assume true; {132246#true} is VALID [2022-04-28 10:16:16,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {132246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132246#true} is VALID [2022-04-28 10:16:16,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {132246#true} call ULTIMATE.init(); {132246#true} is VALID [2022-04-28 10:16:16,412 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:16:16,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703678834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:16,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:16,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:16:16,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252144042] [2022-04-28 10:16:16,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252144042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:16,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:16,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:16:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473621946] [2022-04-28 10:16:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:16:16,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:16,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 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:16:16,436 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:16:16,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:16:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:16:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=1906, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:16:16,437 INFO L87 Difference]: Start difference. First operand 683 states and 893 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 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:16:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:31,064 INFO L93 Difference]: Finished difference Result 1164 states and 1771 transitions. [2022-04-28 10:16:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:16:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 10:16:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 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:16:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 292 transitions. [2022-04-28 10:16:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 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:16:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 292 transitions. [2022-04-28 10:16:31,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 292 transitions. [2022-04-28 10:16:31,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:31,339 INFO L225 Difference]: With dead ends: 1164 [2022-04-28 10:16:31,339 INFO L226 Difference]: Without dead ends: 1118 [2022-04-28 10:16:31,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1156, Invalid=4246, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 10:16:31,340 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 230 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4647 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 4811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 4647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:31,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 231 Invalid, 4811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 4647 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 10:16:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-04-28 10:16:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 713. [2022-04-28 10:16:36,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:36,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1118 states. Second operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,581 INFO L74 IsIncluded]: Start isIncluded. First operand 1118 states. Second operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,581 INFO L87 Difference]: Start difference. First operand 1118 states. Second operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:36,614 INFO L93 Difference]: Finished difference Result 1118 states and 1476 transitions. [2022-04-28 10:16:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1476 transitions. [2022-04-28 10:16:36,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:36,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:36,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1118 states. [2022-04-28 10:16:36,616 INFO L87 Difference]: Start difference. First operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1118 states. [2022-04-28 10:16:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:36,649 INFO L93 Difference]: Finished difference Result 1118 states and 1476 transitions. [2022-04-28 10:16:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1476 transitions. [2022-04-28 10:16:36,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:36,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:36,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:36,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 708 states have (on average 1.3149717514124293) internal successors, (931), 708 states have internal predecessors, (931), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:16:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 935 transitions. [2022-04-28 10:16:36,669 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 935 transitions. Word has length 41 [2022-04-28 10:16:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:36,669 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 935 transitions. [2022-04-28 10:16:36,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 25 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:16:36,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 713 states and 935 transitions. [2022-04-28 10:16:44,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 935 edges. 934 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 935 transitions. [2022-04-28 10:16:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:16:44,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:44,702 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:44,721 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:16:44,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:44,902 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -209000572, now seen corresponding path program 35 times [2022-04-28 10:16:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:44,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [451169621] [2022-04-28 10:16:44,905 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:44,905 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash -209000572, now seen corresponding path program 36 times [2022-04-28 10:16:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:44,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999243347] [2022-04-28 10:16:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:45,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {138606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {138582#true} is VALID [2022-04-28 10:16:45,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {138582#true} assume true; {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138582#true} {138582#true} #94#return; {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {138582#true} call ULTIMATE.init(); {138606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:45,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {138606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {138582#true} assume true; {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138582#true} {138582#true} #94#return; {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {138582#true} call #t~ret17 := main(); {138582#true} is VALID [2022-04-28 10:16:45,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {138582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138587#(= main_~y~0 0)} is VALID [2022-04-28 10:16:45,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {138587#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:45,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {138588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:45,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {138589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:45,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {138590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:45,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {138591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:45,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {138592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:45,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {138593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:45,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {138594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:45,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:45,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {138596#(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; {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:45,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {138597#(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; {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:45,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {138598#(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; {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:45,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {138599#(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; {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:45,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {138600#(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; {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:45,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {138601#(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; {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:45,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {138602#(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; {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:45,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {138603#(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; {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:45,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:45,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:45,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:45,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:45,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:45,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:45,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:45,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:45,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {138605#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {138605#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {138583#false} assume !(~y~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:45,225 INFO L272 TraceCheckUtils]: 38: Hoare triple {138583#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {138583#false} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {138583#false} ~cond := #in~cond; {138583#false} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {138583#false} assume 0 == ~cond; {138583#false} is VALID [2022-04-28 10:16:45,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {138583#false} assume !false; {138583#false} is VALID [2022-04-28 10:16:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999243347] [2022-04-28 10:16:45,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999243347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059533195] [2022-04-28 10:16:45,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:16:45,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:45,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:45,227 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:16:45,227 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:16:45,452 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:16:45,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:45,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:16:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:45,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:45,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {138582#true} call ULTIMATE.init(); {138582#true} is VALID [2022-04-28 10:16:45,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {138582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {138582#true} is VALID [2022-04-28 10:16:45,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {138582#true} assume true; {138582#true} is VALID [2022-04-28 10:16:45,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138582#true} {138582#true} #94#return; {138582#true} is VALID [2022-04-28 10:16:45,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {138582#true} call #t~ret17 := main(); {138582#true} is VALID [2022-04-28 10:16:45,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {138582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138587#(= main_~y~0 0)} is VALID [2022-04-28 10:16:45,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {138587#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:45,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {138588#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:45,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {138589#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:45,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {138590#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:45,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {138591#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:45,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {138592#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:45,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {138593#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:45,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {138594#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:45,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:45,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {138595#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {138596#(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; {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:45,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {138597#(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; {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:45,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {138598#(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; {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:45,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {138599#(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; {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:45,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {138600#(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; {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:45,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {138601#(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; {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:45,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {138602#(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; {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:45,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {138603#(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; {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:45,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:16:45,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {138604#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:16:45,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {138603#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:16:45,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {138602#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:16:45,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {138601#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:45,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {138600#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:45,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {138599#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:45,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {138598#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:45,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:45,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {138596#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:45,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {138597#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {138583#false} assume !(~y~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L272 TraceCheckUtils]: 38: Hoare triple {138583#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {138583#false} ~cond := #in~cond; {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {138583#false} assume 0 == ~cond; {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {138583#false} assume !false; {138583#false} is VALID [2022-04-28 10:16:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:45,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:46,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {138583#false} assume !false; {138583#false} is VALID [2022-04-28 10:16:46,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {138583#false} assume 0 == ~cond; {138583#false} is VALID [2022-04-28 10:16:46,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {138583#false} ~cond := #in~cond; {138583#false} is VALID [2022-04-28 10:16:46,347 INFO L272 TraceCheckUtils]: 38: Hoare triple {138583#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {138583#false} is VALID [2022-04-28 10:16:46,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {138583#false} assume !(~y~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:46,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {138748#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {138583#false} is VALID [2022-04-28 10:16:46,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {138748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:46,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {138748#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {138765#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:46,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {138769#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138765#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:16:46,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {138773#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138769#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:16:46,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {138777#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138773#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:16:46,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {138781#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138777#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:16:46,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {138785#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138781#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:46,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {138789#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {138785#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:16:46,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {138789#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {138789#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:46,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {138785#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {138789#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:46,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {138781#(< 0 (mod (+ 5 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; {138785#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:16:46,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {138777#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {138781#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:46,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {138773#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {138777#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:16:46,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {138769#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {138773#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:16:46,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {138765#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {138769#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:16:46,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {138748#(< 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; {138765#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:16:46,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {138752#(< 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; {138748#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:46,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {138820#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {138752#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {138820#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {138820#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {138827#(< 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; {138820#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:46,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {138831#(< 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; {138827#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:46,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {138835#(< 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; {138831#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:46,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {138839#(< 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; {138835#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:46,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {138843#(< 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; {138839#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:46,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {138847#(< 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; {138843#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:46,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {138851#(< 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; {138847#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:46,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {138855#(< 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; {138851#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:46,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {138582#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {138855#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:46,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {138582#true} call #t~ret17 := main(); {138582#true} is VALID [2022-04-28 10:16:46,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138582#true} {138582#true} #94#return; {138582#true} is VALID [2022-04-28 10:16:46,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {138582#true} assume true; {138582#true} is VALID [2022-04-28 10:16:46,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {138582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {138582#true} is VALID [2022-04-28 10:16:46,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {138582#true} call ULTIMATE.init(); {138582#true} is VALID [2022-04-28 10:16:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059533195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:46,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:46,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2022-04-28 10:16:46,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [451169621] [2022-04-28 10:16:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [451169621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:46,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:46,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:16:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595982135] [2022-04-28 10:16:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:46,365 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:16:46,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:46,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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:16:46,392 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:16:46,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:16:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:16:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:16:46,393 INFO L87 Difference]: Start difference. First operand 713 states and 935 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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:17:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:02,992 INFO L93 Difference]: Finished difference Result 1081 states and 1583 transitions. [2022-04-28 10:17:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-28 10:17:02,992 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:17:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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:17:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 372 transitions. [2022-04-28 10:17:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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:17:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 372 transitions. [2022-04-28 10:17:02,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 372 transitions. [2022-04-28 10:17:03,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:03,341 INFO L225 Difference]: With dead ends: 1081 [2022-04-28 10:17:03,341 INFO L226 Difference]: Without dead ends: 975 [2022-04-28 10:17:03,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4870 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2478, Invalid=16704, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 10:17:03,342 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 149 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:03,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 135 Invalid, 4450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 10:17:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-04-28 10:17:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 766. [2022-04-28 10:17:09,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:09,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 975 states. Second operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:09,526 INFO L74 IsIncluded]: Start isIncluded. First operand 975 states. Second operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:09,527 INFO L87 Difference]: Start difference. First operand 975 states. Second operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:09,553 INFO L93 Difference]: Finished difference Result 975 states and 1219 transitions. [2022-04-28 10:17:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1219 transitions. [2022-04-28 10:17:09,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:09,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:09,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 975 states. [2022-04-28 10:17:09,555 INFO L87 Difference]: Start difference. First operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 975 states. [2022-04-28 10:17:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:09,581 INFO L93 Difference]: Finished difference Result 975 states and 1219 transitions. [2022-04-28 10:17:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1219 transitions. [2022-04-28 10:17:09,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:09,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:09,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:09,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 761 states have (on average 1.3206307490144547) internal successors, (1005), 761 states have internal predecessors, (1005), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1009 transitions. [2022-04-28 10:17:09,603 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1009 transitions. Word has length 42 [2022-04-28 10:17:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:09,603 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1009 transitions. [2022-04-28 10:17:09,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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:17:09,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 766 states and 1009 transitions. [2022-04-28 10:17:16,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1009 edges. 1009 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1009 transitions. [2022-04-28 10:17:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:17:16,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:16,031 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:16,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-04-28 10:17:16,231 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,SelfDestructingSolverStorable53 [2022-04-28 10:17:16,231 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1651738011, now seen corresponding path program 47 times [2022-04-28 10:17:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:16,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752013923] [2022-04-28 10:17:16,234 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:16,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1651738011, now seen corresponding path program 48 times [2022-04-28 10:17:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:16,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863244866] [2022-04-28 10:17:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:16,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {144747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144718#true} is VALID [2022-04-28 10:17:16,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {144718#true} assume true; {144718#true} is VALID [2022-04-28 10:17:16,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144718#true} {144718#true} #94#return; {144718#true} is VALID [2022-04-28 10:17:16,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {144718#true} call ULTIMATE.init(); {144747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:16,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {144747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144718#true} is VALID [2022-04-28 10:17:16,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {144718#true} assume true; {144718#true} is VALID [2022-04-28 10:17:16,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144718#true} {144718#true} #94#return; {144718#true} is VALID [2022-04-28 10:17:16,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {144718#true} call #t~ret17 := main(); {144718#true} is VALID [2022-04-28 10:17:16,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {144718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144723#(= main_~y~0 0)} is VALID [2022-04-28 10:17:16,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {144723#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:16,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {144724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:16,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {144725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:16,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {144726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:16,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {144727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:16,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {144728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:16,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {144729#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:16,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {144730#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144731#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:16,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {144731#(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; {144732#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:16,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {144732#(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; {144733#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:16,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {144733#(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; {144734#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:16,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {144734#(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; {144735#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:16,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {144735#(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; {144736#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:16,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {144736#(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; {144737#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:17:16,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {144737#(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; {144738#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:17:16,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {144738#(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; {144739#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:17:16,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {144739#(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; {144740#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:17:16,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {144740#(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; {144741#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:17:16,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {144741#(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; {144742#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:17:16,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {144742#(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; {144743#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:17:16,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {144743#(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; {144744#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:16,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {144744#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {144744#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:17:16,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {144744#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {144745#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {144745#(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; {144746#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {144746#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {144719#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {144719#false} assume !(~y~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {144719#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {144719#false} assume !(~x~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {144719#false} assume !(~z~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {144719#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {144719#false} is VALID [2022-04-28 10:17:16,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {144719#false} assume !(~y~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,640 INFO L272 TraceCheckUtils]: 38: Hoare triple {144719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144719#false} is VALID [2022-04-28 10:17:16,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {144719#false} ~cond := #in~cond; {144719#false} is VALID [2022-04-28 10:17:16,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {144719#false} assume 0 == ~cond; {144719#false} is VALID [2022-04-28 10:17:16,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {144719#false} assume !false; {144719#false} is VALID [2022-04-28 10:17:16,640 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:17:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863244866] [2022-04-28 10:17:16,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863244866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559580736] [2022-04-28 10:17:16,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:16,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:16,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:16,641 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:17:16,642 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:17:16,685 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:17:16,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:16,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:17:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:16,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:16,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {144718#true} call ULTIMATE.init(); {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {144718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {144718#true} assume true; {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144718#true} {144718#true} #94#return; {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {144718#true} call #t~ret17 := main(); {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {144718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144718#true} is VALID [2022-04-28 10:17:16,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:16,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {144718#true} assume !(~x~0 % 4294967296 > 0); {144718#true} is VALID [2022-04-28 10:17:16,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {144718#true} ~z~0 := ~y~0; {144835#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:17:16,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {144835#(= 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; {144839#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:17:16,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {144839#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {144839#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:17:16,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {144839#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144846#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:17:16,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {144846#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {144846#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:17:16,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {144846#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:16,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {144719#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {144719#false} assume !(~y~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L272 TraceCheckUtils]: 38: Hoare triple {144719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {144719#false} ~cond := #in~cond; {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {144719#false} assume 0 == ~cond; {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {144719#false} assume !false; {144719#false} is VALID [2022-04-28 10:17:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-04-28 10:17:16,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {144719#false} assume !false; {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {144719#false} assume 0 == ~cond; {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {144719#false} ~cond := #in~cond; {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L272 TraceCheckUtils]: 38: Hoare triple {144719#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {144719#false} assume !(~y~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {144719#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {144719#false} is VALID [2022-04-28 10:17:17,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {144719#false} is VALID [2022-04-28 10:17:17,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:17,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:17,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {144853#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:17,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {144908#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144853#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:17,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {144908#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {144908#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {144915#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod 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; {144908#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {144718#true} ~z~0 := ~y~0; {144915#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {144718#true} assume !(~x~0 % 4294967296 > 0); {144718#true} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {144718#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {144718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144718#true} is VALID [2022-04-28 10:17:17,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {144718#true} call #t~ret17 := main(); {144718#true} is VALID [2022-04-28 10:17:17,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144718#true} {144718#true} #94#return; {144718#true} is VALID [2022-04-28 10:17:17,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {144718#true} assume true; {144718#true} is VALID [2022-04-28 10:17:17,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {144718#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144718#true} is VALID [2022-04-28 10:17:17,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {144718#true} call ULTIMATE.init(); {144718#true} is VALID [2022-04-28 10:17:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-04-28 10:17:17,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559580736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:17,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:17,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 6, 5] total 33 [2022-04-28 10:17:17,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:17,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752013923] [2022-04-28 10:17:17,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752013923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:17,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:17,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:17:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001594803] [2022-04-28 10:17:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:17:17,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:17,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:17:17,035 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:17:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:17:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:17:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:17:17,035 INFO L87 Difference]: Start difference. First operand 766 states and 1009 transitions. Second operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:17:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:33,708 INFO L93 Difference]: Finished difference Result 1268 states and 1927 transitions. [2022-04-28 10:17:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:17:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 10:17:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:17:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 305 transitions. [2022-04-28 10:17:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:17:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 305 transitions. [2022-04-28 10:17:33,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 305 transitions. [2022-04-28 10:17:33,945 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:17:34,005 INFO L225 Difference]: With dead ends: 1268 [2022-04-28 10:17:34,005 INFO L226 Difference]: Without dead ends: 1222 [2022-04-28 10:17:34,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=3112, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:17:34,006 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 246 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5334 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 5508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 5334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:34,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 247 Invalid, 5508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 5334 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 10:17:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-04-28 10:17:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 798. [2022-04-28 10:17:40,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:17:40,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1222 states. Second operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:40,457 INFO L74 IsIncluded]: Start isIncluded. First operand 1222 states. Second operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:40,457 INFO L87 Difference]: Start difference. First operand 1222 states. Second operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:40,496 INFO L93 Difference]: Finished difference Result 1222 states and 1621 transitions. [2022-04-28 10:17:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1621 transitions. [2022-04-28 10:17:40,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:40,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:40,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1222 states. [2022-04-28 10:17:40,498 INFO L87 Difference]: Start difference. First operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1222 states. [2022-04-28 10:17:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:40,536 INFO L93 Difference]: Finished difference Result 1222 states and 1621 transitions. [2022-04-28 10:17:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1621 transitions. [2022-04-28 10:17:40,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:17:40,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:17:40,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:17:40,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:17:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 793 states have (on average 1.3240857503152585) internal successors, (1050), 793 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:17:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1054 transitions. [2022-04-28 10:17:40,564 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1054 transitions. Word has length 42 [2022-04-28 10:17:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:17:40,564 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1054 transitions. [2022-04-28 10:17:40,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 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:17:40,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 798 states and 1054 transitions. [2022-04-28 10:17:46,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1054 transitions. [2022-04-28 10:17:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:17:46,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:46,532 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:46,548 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:17:46,732 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,SelfDestructingSolverStorable54 [2022-04-28 10:17:46,733 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1064258088, now seen corresponding path program 37 times [2022-04-28 10:17:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187745906] [2022-04-28 10:17:46,735 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:46,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1064258088, now seen corresponding path program 38 times [2022-04-28 10:17:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:46,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779894762] [2022-04-28 10:17:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:47,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {151654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151631#true} is VALID [2022-04-28 10:17:47,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {151631#true} assume true; {151631#true} is VALID [2022-04-28 10:17:47,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151631#true} {151631#true} #94#return; {151631#true} is VALID [2022-04-28 10:17:47,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {151631#true} call ULTIMATE.init(); {151654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:47,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {151654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151631#true} is VALID [2022-04-28 10:17:47,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {151631#true} assume true; {151631#true} is VALID [2022-04-28 10:17:47,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151631#true} {151631#true} #94#return; {151631#true} is VALID [2022-04-28 10:17:47,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {151631#true} call #t~ret17 := main(); {151631#true} is VALID [2022-04-28 10:17:47,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {151631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151636#(= main_~y~0 0)} is VALID [2022-04-28 10:17:47,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {151636#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151637#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:47,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {151637#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151638#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:47,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {151638#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151639#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:47,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {151639#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151640#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:47,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {151640#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151641#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:47,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {151641#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151642#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:47,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {151642#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151643#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:47,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {151643#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151644#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:47,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {151644#(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; {151645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:47,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {151645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {151645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:47,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {151645#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {151646#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:47,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {151646#(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; {151647#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:17:47,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {151647#(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; {151648#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:17:47,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {151648#(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; {151649#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:17:47,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {151649#(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; {151650#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:17:47,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {151650#(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; {151651#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:17:47,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {151651#(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; {151652#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:17:47,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {151652#(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; {151653#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {151653#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {151632#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {151632#false} assume !(~y~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {151632#false} assume !(~x~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {151632#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {151632#false} assume !(~z~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {151632#false} assume !(~y~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L272 TraceCheckUtils]: 39: Hoare triple {151632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {151632#false} ~cond := #in~cond; {151632#false} is VALID [2022-04-28 10:17:47,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {151632#false} assume 0 == ~cond; {151632#false} is VALID [2022-04-28 10:17:47,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {151632#false} assume !false; {151632#false} is VALID [2022-04-28 10:17:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:17:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:47,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779894762] [2022-04-28 10:17:47,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779894762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:47,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367914039] [2022-04-28 10:17:47,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:17:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:47,046 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:17:47,047 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:17:47,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:17:47,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:47,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:17:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:47,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:47,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {151631#true} call ULTIMATE.init(); {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {151631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {151631#true} assume true; {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151631#true} {151631#true} #94#return; {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {151631#true} call #t~ret17 := main(); {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {151631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#true} is VALID [2022-04-28 10:17:47,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#true} is VALID [2022-04-28 10:17:47,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:47,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {151682#(< 0 (mod (+ main_~x~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; {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:47,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:47,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {151690#(< 0 (mod (+ main_~x~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; {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:47,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {151694#(< 0 (mod (+ main_~x~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; {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:47,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {151706#(< 0 (mod (+ 7 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; {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:47,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {151698#(< 0 (mod (+ 5 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; {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:47,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:47,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:47,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:47,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {151632#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {151632#false} assume !(~z~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {151632#false} assume !(~y~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L272 TraceCheckUtils]: 39: Hoare triple {151632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {151632#false} ~cond := #in~cond; {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {151632#false} assume 0 == ~cond; {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {151632#false} assume !false; {151632#false} is VALID [2022-04-28 10:17:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 10:17:47,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {151632#false} assume !false; {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {151632#false} assume 0 == ~cond; {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {151632#false} ~cond := #in~cond; {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L272 TraceCheckUtils]: 39: Hoare triple {151632#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {151632#false} assume !(~y~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {151632#false} assume !(~z~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {151632#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {151632#false} is VALID [2022-04-28 10:17:47,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151632#false} is VALID [2022-04-28 10:17:47,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {151734#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151734#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:17:47,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:47,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:47,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:47,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {151698#(< 0 (mod (+ 5 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; {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:47,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {151706#(< 0 (mod (+ 7 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; {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:47,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151706#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151702#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:17:47,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {151694#(< 0 (mod (+ main_~x~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; {151698#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:17:47,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {151690#(< 0 (mod (+ main_~x~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; {151694#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:17:47,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151690#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:17:47,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {151682#(< 0 (mod (+ main_~x~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; {151686#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151682#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {151631#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {151631#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {151631#true} call #t~ret17 := main(); {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151631#true} {151631#true} #94#return; {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {151631#true} assume true; {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {151631#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {151631#true} call ULTIMATE.init(); {151631#true} is VALID [2022-04-28 10:17:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-28 10:17:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367914039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:47,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 29 [2022-04-28 10:17:47,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:47,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187745906] [2022-04-28 10:17:47,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187745906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:47,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:47,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:17:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677199284] [2022-04-28 10:17:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:17:47,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:47,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:17:47,587 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:17:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:17:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:17:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:17:47,587 INFO L87 Difference]: Start difference. First operand 798 states and 1054 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:17:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:17:57,356 INFO L93 Difference]: Finished difference Result 1024 states and 1376 transitions. [2022-04-28 10:17:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 10:17:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:17:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:17:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:17:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 161 transitions. [2022-04-28 10:17:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:17:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 161 transitions. [2022-04-28 10:17:57,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 161 transitions. [2022-04-28 10:17:57,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:57,506 INFO L225 Difference]: With dead ends: 1024 [2022-04-28 10:17:57,506 INFO L226 Difference]: Without dead ends: 855 [2022-04-28 10:17:57,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=4360, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 10:17:57,506 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 100 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:17:57,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:17:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-04-28 10:18:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 799. [2022-04-28 10:18:03,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:03,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:03,983 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:03,983 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:04,005 INFO L93 Difference]: Finished difference Result 855 states and 1137 transitions. [2022-04-28 10:18:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1137 transitions. [2022-04-28 10:18:04,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:04,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:04,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 855 states. [2022-04-28 10:18:04,006 INFO L87 Difference]: Start difference. First operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 855 states. [2022-04-28 10:18:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:04,027 INFO L93 Difference]: Finished difference Result 855 states and 1137 transitions. [2022-04-28 10:18:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1137 transitions. [2022-04-28 10:18:04,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:04,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:04,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:04,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 794 states have (on average 1.318639798488665) internal successors, (1047), 794 states have internal predecessors, (1047), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1051 transitions. [2022-04-28 10:18:04,055 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1051 transitions. Word has length 43 [2022-04-28 10:18:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:04,055 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1051 transitions. [2022-04-28 10:18:04,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 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:18:04,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 799 states and 1051 transitions. [2022-04-28 10:18:10,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1051 edges. 1051 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1051 transitions. [2022-04-28 10:18:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:10,349 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:10,366 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:18:10,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-28 10:18:10,549 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1685814809, now seen corresponding path program 49 times [2022-04-28 10:18:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:10,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9341891] [2022-04-28 10:18:10,552 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:10,552 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1685814809, now seen corresponding path program 50 times [2022-04-28 10:18:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:10,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185871433] [2022-04-28 10:18:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:10,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {157375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157356#true} is VALID [2022-04-28 10:18:10,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {157356#true} assume true; {157356#true} is VALID [2022-04-28 10:18:10,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157356#true} {157356#true} #94#return; {157356#true} is VALID [2022-04-28 10:18:10,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {157356#true} call ULTIMATE.init(); {157375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:10,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {157375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157356#true} is VALID [2022-04-28 10:18:10,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {157356#true} assume true; {157356#true} is VALID [2022-04-28 10:18:10,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157356#true} {157356#true} #94#return; {157356#true} is VALID [2022-04-28 10:18:10,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {157356#true} call #t~ret17 := main(); {157356#true} is VALID [2022-04-28 10:18:10,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {157356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157361#(= main_~y~0 0)} is VALID [2022-04-28 10:18:10,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {157361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:10,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {157362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:10,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {157363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157364#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:10,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {157364#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157365#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:10,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {157365#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157366#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:10,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {157366#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157367#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:10,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {157367#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157368#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:10,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {157368#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157369#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:10,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {157369#(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; {157370#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:10,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {157370#(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; {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:10,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:10,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {157372#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:18:10,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {157372#(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; {157373#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {157373#(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; {157374#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {157374#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {157357#false} assume !(~y~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {157357#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {157357#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {157357#false} assume !(~x~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {157357#false} assume !(~z~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {157357#false} assume !(~y~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L272 TraceCheckUtils]: 39: Hoare triple {157357#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {157357#false} ~cond := #in~cond; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {157357#false} assume 0 == ~cond; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {157357#false} assume !false; {157357#false} is VALID [2022-04-28 10:18:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 10:18:10,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:10,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185871433] [2022-04-28 10:18:10,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185871433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:10,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236806161] [2022-04-28 10:18:10,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:18:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:10,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:10,773 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:18:10,775 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:18:10,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:18:10,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:10,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:18:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:10,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:11,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {157356#true} call ULTIMATE.init(); {157356#true} is VALID [2022-04-28 10:18:11,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {157356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157356#true} is VALID [2022-04-28 10:18:11,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {157356#true} assume true; {157356#true} is VALID [2022-04-28 10:18:11,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157356#true} {157356#true} #94#return; {157356#true} is VALID [2022-04-28 10:18:11,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {157356#true} call #t~ret17 := main(); {157356#true} is VALID [2022-04-28 10:18:11,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {157356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157361#(= main_~y~0 0)} is VALID [2022-04-28 10:18:11,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {157361#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:11,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {157362#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:11,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {157363#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157364#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:11,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {157364#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157365#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:11,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {157365#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157366#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:11,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {157366#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157367#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:11,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {157367#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157368#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:11,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {157368#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {157369#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:11,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {157369#(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; {157370#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:11,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {157370#(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; {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:11,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:11,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {157371#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {157372#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:18:11,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {157372#(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; {157373#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:11,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {157373#(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; {157436#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:11,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {157436#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {157436#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:18:11,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {157436#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157373#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:18:11,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {157373#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157372#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:18:11,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {157372#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157449#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:18:11,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {157449#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157453#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:18:11,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {157453#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:18:11,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {157457#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157461#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:18:11,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {157461#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157465#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:18:11,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {157465#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157469#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:18:11,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {157469#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157473#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:18:11,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {157473#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:18:11,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~y~0 % 4294967296 > 0); {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:18:11,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:18:11,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~x~0 % 4294967296 > 0); {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {157477#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {157357#false} assume !(~y~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L272 TraceCheckUtils]: 39: Hoare triple {157357#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {157357#false} ~cond := #in~cond; {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {157357#false} assume 0 == ~cond; {157357#false} is VALID [2022-04-28 10:18:11,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {157357#false} assume !false; {157357#false} is VALID [2022-04-28 10:18:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:18:11,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:12,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {157357#false} assume !false; {157357#false} is VALID [2022-04-28 10:18:12,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {157357#false} assume 0 == ~cond; {157357#false} is VALID [2022-04-28 10:18:12,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {157357#false} ~cond := #in~cond; {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L272 TraceCheckUtils]: 39: Hoare triple {157357#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {157357#false} assume !(~y~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {157357#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {157535#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {157357#false} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {157535#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {157535#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:12,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {157535#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157535#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:12,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {157535#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {157535#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:12,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {157535#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {157535#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:12,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {157551#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157535#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:12,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {157555#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157551#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 10:18:12,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {157559#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157555#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 10:18:12,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {157563#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157559#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 10:18:12,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {157567#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157563#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 10:18:12,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {157571#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157567#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:12,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {157575#(< 0 (mod (+ 7 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157571#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 10:18:12,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {157579#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157575#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 10:18:12,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {157583#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157579#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:18:12,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {157587#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {157583#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:18:12,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {157587#(< 0 (mod (+ main_~z~0 10) 4294967296))} assume !(~z~0 % 4294967296 > 0); {157587#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:18:12,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {157583#(< 0 (mod (+ main_~z~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157587#(< 0 (mod (+ main_~z~0 10) 4294967296))} is VALID [2022-04-28 10:18:12,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {157579#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {157583#(< 0 (mod (+ main_~z~0 9) 4294967296))} is VALID [2022-04-28 10:18:12,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {157600#(< 0 (mod (+ main_~y~0 8) 4294967296))} ~z~0 := ~y~0; {157579#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 10:18:12,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {157600#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {157600#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:18:12,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {157607#(< 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; {157600#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:18:12,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {157611#(< 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; {157607#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:18:12,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {157615#(< 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; {157611#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:18:12,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {157619#(< 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; {157615#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:18:12,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {157623#(< 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; {157619#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:18:12,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {157627#(< 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; {157623#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:18:12,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {157631#(< 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; {157627#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:18:12,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {157635#(< 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; {157631#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:18:12,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {157639#(< 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; {157635#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:18:12,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {157643#(< 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; {157639#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:18:12,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {157356#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {157643#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:18:12,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {157356#true} call #t~ret17 := main(); {157356#true} is VALID [2022-04-28 10:18:12,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157356#true} {157356#true} #94#return; {157356#true} is VALID [2022-04-28 10:18:12,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {157356#true} assume true; {157356#true} is VALID [2022-04-28 10:18:12,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {157356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {157356#true} is VALID [2022-04-28 10:18:12,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {157356#true} call ULTIMATE.init(); {157356#true} is VALID [2022-04-28 10:18:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:18:12,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236806161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:12,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24, 24] total 48 [2022-04-28 10:18:12,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9341891] [2022-04-28 10:18:12,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9341891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:12,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:18:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604201998] [2022-04-28 10:18:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:12,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:12,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:12,055 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:18:12,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:18:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:18:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:18:12,056 INFO L87 Difference]: Start difference. First operand 799 states and 1051 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:21,639 INFO L93 Difference]: Finished difference Result 949 states and 1235 transitions. [2022-04-28 10:18:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:18:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2022-04-28 10:18:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2022-04-28 10:18:21,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 144 transitions. [2022-04-28 10:18:21,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:21,790 INFO L225 Difference]: With dead ends: 949 [2022-04-28 10:18:21,790 INFO L226 Difference]: Without dead ends: 923 [2022-04-28 10:18:21,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=656, Invalid=3504, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:18:21,791 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 119 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:21,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 132 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:18:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-04-28 10:18:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 799. [2022-04-28 10:18:28,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:18:28,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 923 states. Second operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:28,280 INFO L74 IsIncluded]: Start isIncluded. First operand 923 states. Second operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:28,280 INFO L87 Difference]: Start difference. First operand 923 states. Second operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:28,307 INFO L93 Difference]: Finished difference Result 923 states and 1206 transitions. [2022-04-28 10:18:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1206 transitions. [2022-04-28 10:18:28,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:28,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:28,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 923 states. [2022-04-28 10:18:28,309 INFO L87 Difference]: Start difference. First operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 923 states. [2022-04-28 10:18:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:28,333 INFO L93 Difference]: Finished difference Result 923 states and 1206 transitions. [2022-04-28 10:18:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1206 transitions. [2022-04-28 10:18:28,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:18:28,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:18:28,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:18:28,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:18:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 794 states have (on average 1.3173803526448362) internal successors, (1046), 794 states have internal predecessors, (1046), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:18:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1050 transitions. [2022-04-28 10:18:28,372 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1050 transitions. Word has length 43 [2022-04-28 10:18:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:18:28,373 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1050 transitions. [2022-04-28 10:18:28,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 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:18:28,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 799 states and 1050 transitions. [2022-04-28 10:18:36,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1050 edges. 1049 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1050 transitions. [2022-04-28 10:18:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:18:36,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:18:36,890 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:18:36,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 10:18:37,090 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,SelfDestructingSolverStorable56 [2022-04-28 10:18:37,091 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:18:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:18:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash 176066728, now seen corresponding path program 51 times [2022-04-28 10:18:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:37,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2034371639] [2022-04-28 10:18:37,093 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:18:37,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:18:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 176066728, now seen corresponding path program 52 times [2022-04-28 10:18:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:18:37,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195890042] [2022-04-28 10:18:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:18:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:18:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:18:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:37,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {163070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163040#true} is VALID [2022-04-28 10:18:37,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {163040#true} assume true; {163040#true} is VALID [2022-04-28 10:18:37,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163040#true} {163040#true} #94#return; {163040#true} is VALID [2022-04-28 10:18:37,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {163040#true} call ULTIMATE.init(); {163070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:18:37,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {163070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163040#true} is VALID [2022-04-28 10:18:37,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {163040#true} assume true; {163040#true} is VALID [2022-04-28 10:18:37,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163040#true} {163040#true} #94#return; {163040#true} is VALID [2022-04-28 10:18:37,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {163040#true} call #t~ret17 := main(); {163040#true} is VALID [2022-04-28 10:18:37,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {163040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163045#(= main_~y~0 0)} is VALID [2022-04-28 10:18:37,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {163045#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:37,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {163046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:37,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {163047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:37,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {163048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:37,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {163049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:37,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {163050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163051#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:37,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {163051#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163052#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:37,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {163052#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163053#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:37,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {163053#(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; {163054#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:37,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {163054#(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; {163055#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:37,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {163055#(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; {163056#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:37,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {163056#(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; {163057#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:37,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {163057#(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; {163058#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:37,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {163058#(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; {163059#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:37,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {163059#(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; {163060#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:37,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {163060#(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; {163061#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:37,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {163061#(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; {163062#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:37,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {163062#(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; {163063#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:37,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {163063#(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; {163064#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:37,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {163064#(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; {163065#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:37,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {163065#(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; {163066#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:37,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {163066#(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; {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:37,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:37,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {163068#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {163068#(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; {163069#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {163069#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {163041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {163041#false} assume !(~x~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {163041#false} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L272 TraceCheckUtils]: 39: Hoare triple {163041#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {163041#false} ~cond := #in~cond; {163041#false} is VALID [2022-04-28 10:18:37,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {163041#false} assume 0 == ~cond; {163041#false} is VALID [2022-04-28 10:18:37,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {163041#false} assume !false; {163041#false} is VALID [2022-04-28 10:18:37,528 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:18:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:18:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195890042] [2022-04-28 10:18:37,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195890042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:18:37,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593775038] [2022-04-28 10:18:37,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:18:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:18:37,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:18:37,529 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:18:37,530 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:18:37,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:18:37,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:18:37,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:18:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:18:37,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:18:37,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {163040#true} call ULTIMATE.init(); {163040#true} is VALID [2022-04-28 10:18:37,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {163040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163040#true} is VALID [2022-04-28 10:18:37,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {163040#true} assume true; {163040#true} is VALID [2022-04-28 10:18:37,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163040#true} {163040#true} #94#return; {163040#true} is VALID [2022-04-28 10:18:37,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {163040#true} call #t~ret17 := main(); {163040#true} is VALID [2022-04-28 10:18:37,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {163040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163045#(= main_~y~0 0)} is VALID [2022-04-28 10:18:37,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {163045#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:18:37,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {163046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:18:37,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {163047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:18:37,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {163048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:18:37,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {163049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:18:37,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {163050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163051#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:18:37,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {163051#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163052#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:18:37,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {163052#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {163053#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:18:37,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {163053#(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; {163054#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:18:37,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {163054#(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; {163055#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:18:37,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {163055#(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; {163056#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:18:37,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {163056#(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; {163057#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:18:37,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {163057#(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; {163058#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:18:37,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {163058#(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; {163059#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:18:37,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {163059#(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; {163060#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:18:37,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {163060#(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; {163061#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:18:37,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {163061#(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; {163062#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:18:37,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {163062#(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; {163063#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:18:37,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {163063#(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; {163064#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:18:37,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {163064#(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; {163065#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:18:37,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {163065#(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; {163066#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:18:37,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {163066#(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; {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:37,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:18:37,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {163067#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {163068#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {163068#(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; {163164#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {163164#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {163041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {163041#false} assume !(~x~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {163041#false} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {163041#false} is VALID [2022-04-28 10:18:37,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:37,968 INFO L272 TraceCheckUtils]: 39: Hoare triple {163041#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163041#false} is VALID [2022-04-28 10:18:37,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {163041#false} ~cond := #in~cond; {163041#false} is VALID [2022-04-28 10:18:37,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {163041#false} assume 0 == ~cond; {163041#false} is VALID [2022-04-28 10:18:37,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {163041#false} assume !false; {163041#false} is VALID [2022-04-28 10:18:37,968 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:18:37,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:18:38,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {163041#false} assume !false; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {163041#false} assume 0 == ~cond; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {163041#false} ~cond := #in~cond; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L272 TraceCheckUtils]: 39: Hoare triple {163041#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {163041#false} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {163041#false} assume !(~x~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {163041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {163041#false} assume !(~y~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {163041#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {163041#false} is VALID [2022-04-28 10:18:38,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {163234#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {163041#false} is VALID [2022-04-28 10:18:38,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {163238#(< 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; {163234#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:18:38,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {163242#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {163238#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:38,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {163242#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {163242#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:38,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {163249#(< 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; {163242#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:18:38,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {163253#(< 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; {163249#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:18:38,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {163257#(< 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; {163253#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:18:38,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {163261#(< 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; {163257#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:18:38,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {163265#(< 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; {163261#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:18:38,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {163269#(< 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; {163265#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:18:38,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {163273#(< 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; {163269#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:38,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {163277#(< 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; {163273#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:18:38,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {163281#(< 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; {163277#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:38,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {163285#(< 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; {163281#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:18:38,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {163289#(< 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; {163285#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:18:38,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {163293#(< 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; {163289#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:18:38,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {163297#(< 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; {163293#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:18:38,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {163301#(< 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; {163297#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:18:38,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {163305#(< 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; {163301#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:18:38,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {163309#(< 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; {163305#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:18:38,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {163313#(< 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; {163309#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:18:38,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {163317#(< 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; {163313#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:18:38,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {163321#(< 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; {163317#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:18:38,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {163325#(< 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; {163321#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:18:38,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {163329#(< 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; {163325#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:18:38,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {163333#(< 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; {163329#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:18:38,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {163040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {163333#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:18:38,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {163040#true} call #t~ret17 := main(); {163040#true} is VALID [2022-04-28 10:18:38,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163040#true} {163040#true} #94#return; {163040#true} is VALID [2022-04-28 10:18:38,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {163040#true} assume true; {163040#true} is VALID [2022-04-28 10:18:38,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {163040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163040#true} is VALID [2022-04-28 10:18:38,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {163040#true} call ULTIMATE.init(); {163040#true} is VALID [2022-04-28 10:18:38,934 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:18:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593775038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:18:38,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:18:38,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:18:38,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:18:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2034371639] [2022-04-28 10:18:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2034371639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:18:38,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:18:38,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:18:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450284876] [2022-04-28 10:18:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:18:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:18:38,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:18:38,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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:18:38,959 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:18:38,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:18:38,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:18:38,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:18:38,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2222, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:18:38,960 INFO L87 Difference]: Start difference. First operand 799 states and 1050 transitions. Second operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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:18:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:18:56,632 INFO L93 Difference]: Finished difference Result 1320 states and 2005 transitions. [2022-04-28 10:18:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:18:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 10:18:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:18:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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:18:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 318 transitions. [2022-04-28 10:18:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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:18:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 318 transitions. [2022-04-28 10:18:56,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 318 transitions. [2022-04-28 10:18:56,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:18:56,942 INFO L225 Difference]: With dead ends: 1320 [2022-04-28 10:18:56,942 INFO L226 Difference]: Without dead ends: 1274 [2022-04-28 10:18:56,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1354, Invalid=4966, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 10:18:56,943 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 260 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5595 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 5778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 5595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:18:56,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 253 Invalid, 5778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 5595 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 10:18:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-04-28 10:19:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 831. [2022-04-28 10:19:03,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:03,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1274 states. Second operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,700 INFO L74 IsIncluded]: Start isIncluded. First operand 1274 states. Second operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,701 INFO L87 Difference]: Start difference. First operand 1274 states. Second operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:03,742 INFO L93 Difference]: Finished difference Result 1274 states and 1688 transitions. [2022-04-28 10:19:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1688 transitions. [2022-04-28 10:19:03,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:03,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:03,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1274 states. [2022-04-28 10:19:03,744 INFO L87 Difference]: Start difference. First operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1274 states. [2022-04-28 10:19:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:03,785 INFO L93 Difference]: Finished difference Result 1274 states and 1688 transitions. [2022-04-28 10:19:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1688 transitions. [2022-04-28 10:19:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:03,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:03,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 826 states have (on average 1.320823244552058) internal successors, (1091), 826 states have internal predecessors, (1091), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1095 transitions. [2022-04-28 10:19:03,813 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1095 transitions. Word has length 43 [2022-04-28 10:19:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:03,813 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1095 transitions. [2022-04-28 10:19:03,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 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:19:03,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 831 states and 1095 transitions. [2022-04-28 10:19:12,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1095 edges. 1094 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1095 transitions. [2022-04-28 10:19:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:19:12,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:12,862 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:12,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:13,062 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,SelfDestructingSolverStorable57 [2022-04-28 10:19:13,062 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1208050166, now seen corresponding path program 39 times [2022-04-28 10:19:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:13,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391012262] [2022-04-28 10:19:13,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:13,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1208050166, now seen corresponding path program 40 times [2022-04-28 10:19:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:13,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855794798] [2022-04-28 10:19:13,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:13,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {170280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {170256#true} is VALID [2022-04-28 10:19:13,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {170256#true} assume true; {170256#true} is VALID [2022-04-28 10:19:13,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170256#true} {170256#true} #94#return; {170256#true} is VALID [2022-04-28 10:19:13,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {170256#true} call ULTIMATE.init(); {170280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:13,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {170280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {170256#true} is VALID [2022-04-28 10:19:13,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {170256#true} assume true; {170256#true} is VALID [2022-04-28 10:19:13,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170256#true} {170256#true} #94#return; {170256#true} is VALID [2022-04-28 10:19:13,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {170256#true} call #t~ret17 := main(); {170256#true} is VALID [2022-04-28 10:19:13,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {170256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170261#(= main_~y~0 0)} is VALID [2022-04-28 10:19:13,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {170261#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {170262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:13,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {170263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:13,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {170264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:13,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {170265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:13,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {170266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:13,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {170267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:13,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {170268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:13,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {170269#(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; {170270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:13,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {170270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {170270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:13,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {170270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {170271#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:19:13,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {170271#(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; {170272#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:19:13,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {170272#(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; {170273#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:19:13,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {170273#(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; {170274#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:19:13,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {170274#(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; {170275#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:19:13,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {170275#(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; {170276#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:19:13,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {170276#(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; {170277#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:19:13,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {170277#(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; {170278#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:19:13,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {170278#(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; {170279#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {170279#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {170257#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {170257#false} assume !(~y~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {170257#false} assume !(~x~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {170257#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {170257#false} assume !(~z~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {170257#false} assume !(~y~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L272 TraceCheckUtils]: 40: Hoare triple {170257#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {170257#false} is VALID [2022-04-28 10:19:13,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {170257#false} ~cond := #in~cond; {170257#false} is VALID [2022-04-28 10:19:13,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {170257#false} assume 0 == ~cond; {170257#false} is VALID [2022-04-28 10:19:13,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {170257#false} assume !false; {170257#false} is VALID [2022-04-28 10:19:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:19:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855794798] [2022-04-28 10:19:13,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855794798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158950306] [2022-04-28 10:19:13,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:19:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:13,374 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:19:13,375 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:19:13,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:19:13,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:13,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:19:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:13,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:13,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {170256#true} call ULTIMATE.init(); {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {170256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {170256#true} assume true; {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170256#true} {170256#true} #94#return; {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {170256#true} call #t~ret17 := main(); {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {170256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170256#true} is VALID [2022-04-28 10:19:13,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {170256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170256#true} is VALID [2022-04-28 10:19:13,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {170256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:13,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {170305#(< 0 (mod (+ main_~x~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; {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:13,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:13,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {170313#(< 0 (mod (+ main_~x~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; {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:13,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {170317#(< 0 (mod (+ main_~x~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; {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:13,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {170329#(< 0 (mod (+ 7 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; {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:13,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {170321#(< 0 (mod (+ 5 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; {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:13,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:13,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:13,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:13,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {170257#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {170257#false} assume !(~z~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {170257#false} assume !(~y~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L272 TraceCheckUtils]: 40: Hoare triple {170257#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {170257#false} ~cond := #in~cond; {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {170257#false} assume 0 == ~cond; {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {170257#false} assume !false; {170257#false} is VALID [2022-04-28 10:19:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:19:13,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:13,931 INFO L290 TraceCheckUtils]: 43: Hoare triple {170257#false} assume !false; {170257#false} is VALID [2022-04-28 10:19:13,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {170257#false} assume 0 == ~cond; {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {170257#false} ~cond := #in~cond; {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L272 TraceCheckUtils]: 40: Hoare triple {170257#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {170257#false} assume !(~y~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {170257#false} assume !(~z~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {170257#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {170257#false} is VALID [2022-04-28 10:19:13,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {170364#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170364#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:19:13,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:13,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:13,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:13,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {170321#(< 0 (mod (+ 5 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; {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:13,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {170329#(< 0 (mod (+ 7 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; {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:13,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170333#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:19:13,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170329#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170325#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:19:13,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {170317#(< 0 (mod (+ main_~x~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; {170321#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:19:13,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {170313#(< 0 (mod (+ main_~x~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; {170317#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:19:13,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170313#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:19:13,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {170305#(< 0 (mod (+ main_~x~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; {170309#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:19:13,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {170256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170305#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:19:13,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {170256#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {170256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {170256#true} call #t~ret17 := main(); {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170256#true} {170256#true} #94#return; {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {170256#true} assume true; {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {170256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {170256#true} call ULTIMATE.init(); {170256#true} is VALID [2022-04-28 10:19:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 10:19:13,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158950306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:13,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:13,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-28 10:19:13,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:13,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391012262] [2022-04-28 10:19:13,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391012262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:13,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:13,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:19:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437715574] [2022-04-28 10:19:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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 44 [2022-04-28 10:19:13,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:13,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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:19:13,973 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:19:13,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:19:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:19:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:19:13,974 INFO L87 Difference]: Start difference. First operand 831 states and 1095 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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:19:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:24,986 INFO L93 Difference]: Finished difference Result 1000 states and 1362 transitions. [2022-04-28 10:19:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 10:19:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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 44 [2022-04-28 10:19:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:19:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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:19:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 158 transitions. [2022-04-28 10:19:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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:19:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 158 transitions. [2022-04-28 10:19:24,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 158 transitions. [2022-04-28 10:19:25,105 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:19:25,137 INFO L225 Difference]: With dead ends: 1000 [2022-04-28 10:19:25,138 INFO L226 Difference]: Without dead ends: 888 [2022-04-28 10:19:25,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=377, Invalid=5323, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:19:25,138 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 97 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:19:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 139 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:19:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-04-28 10:19:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 832. [2022-04-28 10:19:31,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:19:31,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 888 states. Second operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:31,840 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:31,841 INFO L87 Difference]: Start difference. First operand 888 states. Second operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:31,863 INFO L93 Difference]: Finished difference Result 888 states and 1182 transitions. [2022-04-28 10:19:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1182 transitions. [2022-04-28 10:19:31,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:31,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:31,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 888 states. [2022-04-28 10:19:31,865 INFO L87 Difference]: Start difference. First operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 888 states. [2022-04-28 10:19:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:19:31,886 INFO L93 Difference]: Finished difference Result 888 states and 1182 transitions. [2022-04-28 10:19:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1182 transitions. [2022-04-28 10:19:31,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:19:31,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:19:31,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:19:31,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:19:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 827 states have (on average 1.32043530834341) internal successors, (1092), 827 states have internal predecessors, (1092), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:19:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1096 transitions. [2022-04-28 10:19:31,915 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1096 transitions. Word has length 44 [2022-04-28 10:19:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:19:31,915 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1096 transitions. [2022-04-28 10:19:31,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 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:19:31,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 832 states and 1096 transitions. [2022-04-28 10:19:41,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1095 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:19:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1096 transitions. [2022-04-28 10:19:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:19:41,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:19:41,494 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:19:41,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 10:19:41,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 10:19:41,695 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:19:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:19:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1003438789, now seen corresponding path program 53 times [2022-04-28 10:19:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:41,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324642721] [2022-04-28 10:19:41,698 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:19:41,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:19:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1003438789, now seen corresponding path program 54 times [2022-04-28 10:19:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:19:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081657116] [2022-04-28 10:19:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:19:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:19:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:19:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {176114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176083#true} is VALID [2022-04-28 10:19:42,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {176083#true} assume true; {176083#true} is VALID [2022-04-28 10:19:42,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176083#true} {176083#true} #94#return; {176083#true} is VALID [2022-04-28 10:19:42,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {176083#true} call ULTIMATE.init(); {176114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:19:42,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {176114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176083#true} is VALID [2022-04-28 10:19:42,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {176083#true} assume true; {176083#true} is VALID [2022-04-28 10:19:42,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176083#true} {176083#true} #94#return; {176083#true} is VALID [2022-04-28 10:19:42,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {176083#true} call #t~ret17 := main(); {176083#true} is VALID [2022-04-28 10:19:42,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {176083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {176088#(= main_~y~0 0)} is VALID [2022-04-28 10:19:42,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {176088#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176089#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:19:42,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {176089#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176090#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:19:42,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {176090#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176091#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:19:42,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {176091#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176092#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:19:42,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {176092#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176093#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:19:42,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {176093#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176094#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:19:42,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {176094#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176095#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:19:42,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {176095#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176096#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:19:42,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {176096#(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; {176097#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:19:42,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {176097#(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; {176098#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:19:42,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {176098#(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; {176099#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:19:42,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {176099#(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; {176100#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:19:42,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {176100#(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; {176101#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:19:42,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {176101#(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; {176102#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:19:42,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {176102#(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; {176103#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:19:42,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {176103#(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; {176104#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:19:42,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {176104#(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; {176105#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:19:42,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {176105#(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; {176106#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:19:42,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {176106#(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; {176107#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:19:42,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {176107#(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; {176108#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:19:42,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {176108#(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; {176109#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:19:42,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {176109#(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; {176110#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:19:42,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {176110#(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; {176111#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:42,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {176111#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {176111#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:19:42,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {176111#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {176112#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:19:42,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {176112#(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; {176113#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {176113#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {176084#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {176084#false} assume !(~y~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {176084#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {176084#false} assume !(~x~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {176084#false} assume !(~z~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {176084#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {176084#false} assume !(~y~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L272 TraceCheckUtils]: 40: Hoare triple {176084#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {176084#false} ~cond := #in~cond; {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {176084#false} assume 0 == ~cond; {176084#false} is VALID [2022-04-28 10:19:42,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {176084#false} assume !false; {176084#false} is VALID [2022-04-28 10:19:42,181 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:19:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:19:42,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081657116] [2022-04-28 10:19:42,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081657116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:19:42,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126723155] [2022-04-28 10:19:42,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:19:42,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:19:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:19:42,183 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:19:42,183 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:19:42,224 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:19:42,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:19:42,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:19:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:19:42,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:19:42,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {176083#true} call ULTIMATE.init(); {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {176083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {176083#true} assume true; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176083#true} {176083#true} #94#return; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {176083#true} call #t~ret17 := main(); {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {176083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {176083#true} assume !(~x~0 % 4294967296 > 0); {176083#true} is VALID [2022-04-28 10:19:42,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {176083#true} ~z~0 := ~y~0; {176208#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:19:42,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {176208#(= 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; {176212#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:19:42,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {176212#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {176212#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:19:42,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {176212#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {176084#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {176084#false} assume !(~y~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L272 TraceCheckUtils]: 40: Hoare triple {176084#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {176084#false} ~cond := #in~cond; {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {176084#false} assume 0 == ~cond; {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {176084#false} assume !false; {176084#false} is VALID [2022-04-28 10:19:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-04-28 10:19:42,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:19:42,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {176084#false} assume !false; {176084#false} is VALID [2022-04-28 10:19:42,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {176084#false} assume 0 == ~cond; {176084#false} is VALID [2022-04-28 10:19:42,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {176084#false} ~cond := #in~cond; {176084#false} is VALID [2022-04-28 10:19:42,529 INFO L272 TraceCheckUtils]: 40: Hoare triple {176084#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {176084#false} is VALID [2022-04-28 10:19:42,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {176084#false} assume !(~y~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {176084#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {176084#false} is VALID [2022-04-28 10:19:42,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {176084#false} is VALID [2022-04-28 10:19:42,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {176219#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {176280#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {176219#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:19:42,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {176280#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {176280#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {176287#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {176280#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {176083#true} ~z~0 := ~y~0; {176287#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {176083#true} assume !(~x~0 % 4294967296 > 0); {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {176083#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {176083#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {176083#true} call #t~ret17 := main(); {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176083#true} {176083#true} #94#return; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {176083#true} assume true; {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {176083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176083#true} is VALID [2022-04-28 10:19:42,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {176083#true} call ULTIMATE.init(); {176083#true} is VALID [2022-04-28 10:19:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-04-28 10:19:42,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126723155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:19:42,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:19:42,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 5, 5] total 34 [2022-04-28 10:19:42,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:19:42,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324642721] [2022-04-28 10:19:42,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324642721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:19:42,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:19:42,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:19:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038401818] [2022-04-28 10:19:42,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:19:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 10:19:42,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:19:42,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 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:19:42,562 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:19:42,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:19:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:19:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:19:42,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:19:42,563 INFO L87 Difference]: Start difference. First operand 832 states and 1096 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 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:20:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:01,759 INFO L93 Difference]: Finished difference Result 1372 states and 2088 transitions. [2022-04-28 10:20:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:20:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 10:20:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 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:20:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 331 transitions. [2022-04-28 10:20:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 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:20:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 331 transitions. [2022-04-28 10:20:01,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 331 transitions. [2022-04-28 10:20:02,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:02,095 INFO L225 Difference]: With dead ends: 1372 [2022-04-28 10:20:02,095 INFO L226 Difference]: Without dead ends: 1326 [2022-04-28 10:20:02,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=3458, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:20:02,096 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 274 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6348 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 6348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:02,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 269 Invalid, 6541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 6348 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 10:20:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-04-28 10:20:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 864. [2022-04-28 10:20:09,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:09,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1326 states. Second operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:09,194 INFO L74 IsIncluded]: Start isIncluded. First operand 1326 states. Second operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:09,194 INFO L87 Difference]: Start difference. First operand 1326 states. Second operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:09,237 INFO L93 Difference]: Finished difference Result 1326 states and 1760 transitions. [2022-04-28 10:20:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1760 transitions. [2022-04-28 10:20:09,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:09,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:09,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1326 states. [2022-04-28 10:20:09,239 INFO L87 Difference]: Start difference. First operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1326 states. [2022-04-28 10:20:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:09,283 INFO L93 Difference]: Finished difference Result 1326 states and 1760 transitions. [2022-04-28 10:20:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1760 transitions. [2022-04-28 10:20:09,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:09,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:09,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:09,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 859 states have (on average 1.3236321303841676) internal successors, (1137), 859 states have internal predecessors, (1137), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1141 transitions. [2022-04-28 10:20:09,317 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1141 transitions. Word has length 44 [2022-04-28 10:20:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:09,318 INFO L495 AbstractCegarLoop]: Abstraction has 864 states and 1141 transitions. [2022-04-28 10:20:09,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 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:20:09,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 864 states and 1141 transitions. [2022-04-28 10:20:16,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1141 edges. 1141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:20:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1141 transitions. [2022-04-28 10:20:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:20:16,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:20:16,734 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:20:16,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 10:20:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:16,935 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:20:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:20:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -271824520, now seen corresponding path program 41 times [2022-04-28 10:20:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:16,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060512329] [2022-04-28 10:20:16,937 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:20:16,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:20:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash -271824520, now seen corresponding path program 42 times [2022-04-28 10:20:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:20:16,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64673576] [2022-04-28 10:20:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:20:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:20:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:20:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:17,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {183580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {183561#true} is VALID [2022-04-28 10:20:17,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {183561#true} assume true; {183561#true} is VALID [2022-04-28 10:20:17,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183561#true} {183561#true} #94#return; {183561#true} is VALID [2022-04-28 10:20:17,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {183561#true} call ULTIMATE.init(); {183580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:20:17,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {183580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {183561#true} is VALID [2022-04-28 10:20:17,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {183561#true} assume true; {183561#true} is VALID [2022-04-28 10:20:17,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183561#true} {183561#true} #94#return; {183561#true} is VALID [2022-04-28 10:20:17,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {183561#true} call #t~ret17 := main(); {183561#true} is VALID [2022-04-28 10:20:17,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {183561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183561#true} is VALID [2022-04-28 10:20:17,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {183561#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183567#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-28 10:20:17,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {183567#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183568#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {183568#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183569#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {183569#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183570#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {183570#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183571#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {183571#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:20:17,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:20:17,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 10:20:17,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {183572#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183573#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 10:20:17,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {183573#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183574#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:17,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {183574#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183575#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-28 10:20:17,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {183575#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183576#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-28 10:20:17,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {183576#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183577#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:17,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {183577#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183578#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-28 10:20:17,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {183578#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {183579#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {183562#false} assume !(~z~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {183562#false} assume !(~y~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L272 TraceCheckUtils]: 41: Hoare triple {183562#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {183562#false} ~cond := #in~cond; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {183562#false} assume 0 == ~cond; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {183562#false} assume !false; {183562#false} is VALID [2022-04-28 10:20:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:20:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:20:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64673576] [2022-04-28 10:20:17,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64673576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:20:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797443223] [2022-04-28 10:20:17,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:20:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:20:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:20:17,227 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:20:17,228 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:20:17,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:20:17,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:20:17,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:20:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:20:17,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:20:17,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {183561#true} call ULTIMATE.init(); {183561#true} is VALID [2022-04-28 10:20:17,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {183561#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {183561#true} is VALID [2022-04-28 10:20:17,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {183561#true} assume true; {183561#true} is VALID [2022-04-28 10:20:17,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183561#true} {183561#true} #94#return; {183561#true} is VALID [2022-04-28 10:20:17,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {183561#true} call #t~ret17 := main(); {183561#true} is VALID [2022-04-28 10:20:17,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {183561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183561#true} is VALID [2022-04-28 10:20:17,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {183561#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:17,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:17,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:17,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:17,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:17,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:17,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {183562#false} assume !(~z~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {183562#false} assume !(~y~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L272 TraceCheckUtils]: 41: Hoare triple {183562#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {183562#false} ~cond := #in~cond; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {183562#false} assume 0 == ~cond; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {183562#false} assume !false; {183562#false} is VALID [2022-04-28 10:20:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:20:17,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:20:17,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {183562#false} assume !false; {183562#false} is VALID [2022-04-28 10:20:17,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {183562#false} assume 0 == ~cond; {183562#false} is VALID [2022-04-28 10:20:17,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {183562#false} ~cond := #in~cond; {183562#false} is VALID [2022-04-28 10:20:17,859 INFO L272 TraceCheckUtils]: 41: Hoare triple {183562#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {183562#false} assume !(~y~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {183562#false} assume !(~z~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {183562#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {183562#false} is VALID [2022-04-28 10:20:17,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {183562#false} is VALID [2022-04-28 10:20:17,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183653#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:17,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:17,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:17,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-28 10:20:17,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 10:20:17,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-28 10:20:17,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 10:20:17,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 10:20:17,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {183561#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {183566#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 10:20:17,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {183561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {183561#true} call #t~ret17 := main(); {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183561#true} {183561#true} #94#return; {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {183561#true} assume true; {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {183561#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {183561#true} call ULTIMATE.init(); {183561#true} is VALID [2022-04-28 10:20:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:20:17,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797443223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:20:17,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:20:17,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-28 10:20:17,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:20:17,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060512329] [2022-04-28 10:20:17,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060512329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:20:17,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:20:17,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:20:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070071836] [2022-04-28 10:20:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:20:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:17,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:20:17,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:17,901 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:20:17,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:20:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:20:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:20:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:20:17,902 INFO L87 Difference]: Start difference. First operand 864 states and 1141 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:41,386 INFO L93 Difference]: Finished difference Result 1814 states and 2344 transitions. [2022-04-28 10:20:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:20:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:20:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 137 transitions. [2022-04-28 10:20:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 137 transitions. [2022-04-28 10:20:41,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 137 transitions. [2022-04-28 10:20:41,530 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:20:41,651 INFO L225 Difference]: With dead ends: 1814 [2022-04-28 10:20:41,651 INFO L226 Difference]: Without dead ends: 1712 [2022-04-28 10:20:41,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:20:41,655 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 103 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:20:41,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 93 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:20:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-04-28 10:20:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 913. [2022-04-28 10:20:49,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:20:49,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1712 states. Second operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:49,500 INFO L74 IsIncluded]: Start isIncluded. First operand 1712 states. Second operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:49,500 INFO L87 Difference]: Start difference. First operand 1712 states. Second operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,580 INFO L93 Difference]: Finished difference Result 1712 states and 2194 transitions. [2022-04-28 10:20:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2194 transitions. [2022-04-28 10:20:49,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1712 states. [2022-04-28 10:20:49,582 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1712 states. [2022-04-28 10:20:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:20:49,665 INFO L93 Difference]: Finished difference Result 1712 states and 2194 transitions. [2022-04-28 10:20:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2194 transitions. [2022-04-28 10:20:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:20:49,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:20:49,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:20:49,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:20:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.316079295154185) internal successors, (1195), 908 states have internal predecessors, (1195), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:20:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1199 transitions. [2022-04-28 10:20:49,703 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1199 transitions. Word has length 45 [2022-04-28 10:20:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:20:49,703 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1199 transitions. [2022-04-28 10:20:49,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:20:49,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1199 transitions. [2022-04-28 10:21:00,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1199 edges. 1199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:21:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1199 transitions. [2022-04-28 10:21:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 10:21:00,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:21:00,720 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:21:00,735 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:21:00,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:21:00,920 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:21:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:21:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1364837992, now seen corresponding path program 43 times [2022-04-28 10:21:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:21:00,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244899972] [2022-04-28 10:21:00,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:21:00,923 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:21:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1364837992, now seen corresponding path program 44 times [2022-04-28 10:21:00,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:21:00,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025540884] [2022-04-28 10:21:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:21:00,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:21:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:21:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:21:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:21:01,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {192789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {192763#true} is VALID [2022-04-28 10:21:01,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {192763#true} assume true; {192763#true} is VALID [2022-04-28 10:21:01,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192763#true} {192763#true} #94#return; {192763#true} is VALID [2022-04-28 10:21:01,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {192763#true} call ULTIMATE.init(); {192789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:21:01,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {192789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {192763#true} is VALID [2022-04-28 10:21:01,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {192763#true} assume true; {192763#true} is VALID [2022-04-28 10:21:01,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192763#true} {192763#true} #94#return; {192763#true} is VALID [2022-04-28 10:21:01,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {192763#true} call #t~ret17 := main(); {192763#true} is VALID [2022-04-28 10:21:01,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {192763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192768#(= main_~y~0 0)} is VALID [2022-04-28 10:21:01,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {192768#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:21:01,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {192769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:21:01,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {192770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:21:01,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {192771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:21:01,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {192772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:21:01,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {192773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:21:01,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {192774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:21:01,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {192775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:21:01,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {192776#(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; {192777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:21:01,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {192777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {192777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:21:01,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {192777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:21:01,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {192778#(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; {192779#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:21:01,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {192779#(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; {192780#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:21:01,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {192780#(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; {192781#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:21:01,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {192781#(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; {192782#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:21:01,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {192782#(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; {192783#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:21:01,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {192783#(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; {192784#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:21:01,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {192784#(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; {192785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:21:01,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {192785#(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; {192786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:21:01,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {192786#(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; {192787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:21:01,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {192787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {192787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:21:01,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {192787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:21:01,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {192786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:21:01,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {192785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192784#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:21:01,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {192784#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192783#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:21:01,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {192783#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192782#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:21:01,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {192782#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192781#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:21:01,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {192781#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192780#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:21:01,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {192780#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192779#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:21:01,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {192779#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:21:01,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~y~0 % 4294967296 > 0); {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:21:01,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~x~0 % 4294967296 > 0); {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {192778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {192788#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {192788#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {192764#false} assume !(~y~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,345 INFO L272 TraceCheckUtils]: 41: Hoare triple {192764#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {192764#false} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {192764#false} ~cond := #in~cond; {192764#false} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {192764#false} assume 0 == ~cond; {192764#false} is VALID [2022-04-28 10:21:01,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {192764#false} assume !false; {192764#false} is VALID [2022-04-28 10:21:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:21:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:21:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025540884] [2022-04-28 10:21:01,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025540884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:21:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244437663] [2022-04-28 10:21:01,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:21:01,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:21:01,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:21:01,347 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:21:01,348 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:21:01,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:21:01,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:21:01,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:21:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:21:01,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:21:01,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {192763#true} call ULTIMATE.init(); {192763#true} is VALID [2022-04-28 10:21:01,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {192763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {192763#true} is VALID [2022-04-28 10:21:01,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {192763#true} assume true; {192763#true} is VALID [2022-04-28 10:21:01,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192763#true} {192763#true} #94#return; {192763#true} is VALID [2022-04-28 10:21:01,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {192763#true} call #t~ret17 := main(); {192763#true} is VALID [2022-04-28 10:21:01,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {192763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192763#true} is VALID [2022-04-28 10:21:01,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {192763#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:21:01,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {192811#(< 0 (mod (+ main_~x~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; {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:21:01,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:21:01,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {192819#(< 0 (mod (+ main_~x~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; {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:21:01,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {192823#(< 0 (mod (+ main_~x~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; {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:21:01,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:21:01,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {192839#(< 0 (mod (+ main_~x~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; {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:21:01,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {192835#(< 0 (mod (+ 7 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; {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:21:01,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {192827#(< 0 (mod (+ 5 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; {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:21:01,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:21:01,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:21:01,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:21:01,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {192764#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {192764#false} assume !(~z~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {192764#false} assume !(~y~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L272 TraceCheckUtils]: 41: Hoare triple {192764#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {192764#false} ~cond := #in~cond; {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {192764#false} assume 0 == ~cond; {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {192764#false} assume !false; {192764#false} is VALID [2022-04-28 10:21:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:21:01,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {192764#false} assume !false; {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {192764#false} assume 0 == ~cond; {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {192764#false} ~cond := #in~cond; {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L272 TraceCheckUtils]: 41: Hoare triple {192764#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {192764#false} assume !(~y~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {192764#false} assume !(~z~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 38: Hoare triple {192764#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {192764#false} is VALID [2022-04-28 10:21:01,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {192764#false} is VALID [2022-04-28 10:21:01,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {192877#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192877#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-28 10:21:01,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:21:01,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:21:01,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:21:01,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {192827#(< 0 (mod (+ 5 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; {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:21:01,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {192835#(< 0 (mod (+ 7 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; {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:21:01,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:21:01,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {192839#(< 0 (mod (+ main_~x~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; {192843#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-28 10:21:01,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192839#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-28 10:21:01,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192835#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192831#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-28 10:21:01,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {192823#(< 0 (mod (+ main_~x~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; {192827#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-28 10:21:01,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {192819#(< 0 (mod (+ main_~x~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; {192823#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-28 10:21:01,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192819#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-28 10:21:01,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {192811#(< 0 (mod (+ main_~x~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; {192815#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-28 10:21:01,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {192763#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {192811#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-28 10:21:01,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {192763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {192763#true} call #t~ret17 := main(); {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192763#true} {192763#true} #94#return; {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {192763#true} assume true; {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {192763#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {192763#true} call ULTIMATE.init(); {192763#true} is VALID [2022-04-28 10:21:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:21:01,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244437663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:21:01,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:21:01,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 12] total 34 [2022-04-28 10:21:01,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:21:01,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244899972] [2022-04-28 10:21:01,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244899972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:21:01,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:21:01,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:21:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630663446] [2022-04-28 10:21:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:21:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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 45 [2022-04-28 10:21:01,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:21:01,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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:21:01,988 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:21:01,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:21:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:21:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:21:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:21:01,989 INFO L87 Difference]: Start difference. First operand 913 states and 1199 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 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)